Results 11 to 20 of about 6,708,930 (288)
A study of encodings of constraint satisfaction problems with 0/1 variables [PDF]
, 2003 Many constraint satisfaction problems (csp's) are formulated with 0/1 variables. Sometimes this is a natural encoding, sometimes it is as a result of a reformulation of the problem, other times 0/1 variables make up only a part of the problem. Frequently
Selensky, E., Prosser, P.
core +9 more sources
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation [PDF]
, 2003 This paper identifies a generic axiom framework for prioritised fuzzy constraint satisfaction problems (PFCSPs), and proposes methods to instantiate it (i.e., to construct specific schemes which obey the generic axiom framework).
Luo, X. +14 more
core +2 more sources
Phase transition behaviour in constraint satisfaction problems [PDF]
, 1997 Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment ...
Grant, Stuart Alexander
core +7 more sources
The Constraint Satisfaction Problem: Complexity and Approximability
, 2017 A backdoor set of a CSP instance is a set of variables whose instantiation moves the instance into a fixed class of tractable instances (an island of tractability).
Ordyniak, Sebastian +2 more
core +4 more sources
Compiling constraint satisfaction problems
Artificial Intelligence, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weigel, R., Faltings, B.
openaire +3 more sources
Preventive maintenance scheduling with integer programming and constraint programming [PDF]
مدیریت صنعتی, 2014 Preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. Mathematical models have been developed to solve the preventive maintenance scheduling problem.
Majid Esmaelian, Hajar Bakran
doaj +1 more source
Sensitive instances of the Constraint Satisfaction Problem
CoRR, 2020 We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an instance of the CSP is called sensitive, if removing any tuple from any constraining relation invalidates some ...
Barto, Libor +3 more
openaire +7 more sources
Distance Constraint Satisfaction Problems [PDF]
Information and Computation, 2010 We study the complexity of constraint satisfaction problems for templates $Γ$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain constraint satisfaction (we require the tractability conjecture by Bulatov, Jeavons and Krokhin in the special case of ...
Manuel Bodirsky +4 more
openaire +2 more sources
Subsumption Algorithms for Three-Valued Geometric Resolution [PDF]
Logical Methods in Computer Science, 2018 In our implementation of geometric resolution, the most costly operation is subsumption testing (or matching): One has to decide for a three-valued, geometric formula, if this formula is false in a given interpretation.
Hans de Nivelle
doaj +1 more source
Generalized Majority-Minority Operations are Tractable [PDF]
Logical Methods in Computer Science, 2006 Generalized majority-minority (GMM) operations are introduced as a common generalization of near unanimity operations and Mal'tsev operations on finite sets.
Victor Dalmau
doaj +1 more source