Results 11 to 20 of about 1,354,069 (285)
A study of encodings of constraint satisfaction problems with 0/1 variables [PDF]
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
Phase transition behaviour in constraint satisfaction problems [PDF]
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
Logical compactness and constraint satisfaction problems [PDF]
We investigate a correspondence between the complexity hierarchy of constraint satisfaction problems and a hierarchy of logical compactness hypotheses for finite relational structures.
Danny Rorabaugh +2 more
doaj +1 more source
Universal Algebraic Methods for Constraint Satisfaction Problems [PDF]
After substantial progress over the last 15 years, the "algebraic CSP-dichotomy conjecture" reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if the algebra ...
Clifford Bergman, William DeMeo
doaj +1 more source
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation [PDF]
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
Explanation in Constraint Satisfaction: A Survey [PDF]
Much of the focus on explanation in the field of artificial intelligence has focused on machine learning methods and, in particular, concepts produced by advanced methods such as neural networks and deep learning. However, there has been a long history of explanation generation in the general field of constraint satisfaction, one of the AI's most ...
Dev Gupta, Sharmi +2 more
openaire +2 more sources
Promise Constraint Satisfaction and Width [PDF]
We study the power of the bounded-width consistency algorithm in the context of the fixed-template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that the template of every PCSP that is solvable in bounded width satisfies a certain structural condition implying that its algebraic closure-properties include weak near ...
Atserias, Albert, Dalmau, Víctor
openaire +3 more sources
Sandwiches for promise constraint satisfaction [PDF]
Promise Constraint Satisfaction Problems (PCSP) were proposed recently by Brakensiek and Guruswami arXiv:1704.01937 as a framework to study approximations for Constraint Satisfaction Problems (CSP). Informally a PCSP asks to distinguish between whether a given instance of a CSP has a solution or not even a specified relaxation can be satisfied.
Guofeng Deng +5 more
openaire +3 more sources
Coordination via Interaction Constraints I: Local Logic [PDF]
Wegner describes coordination as constrained interaction. We take this approach literally and define a coordination model based on interaction constraints and partial, iterative and interactive constraint satisfaction.
Dave Clarke, José Proença
doaj +1 more source
Error-Bounded Learned Scientific Data Compression with Preservation of Derived Quantities
Scientific applications continue to grow and produce extremely large amounts of data, which require efficient compression algorithms for long-term storage.
Jaemoon Lee +6 more
doaj +1 more source

