Results 11 to 20 of about 15,838 (263)
Universal Algebraic Methods for Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2022 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
Error-Bounded Learned Scientific Data Compression with Preservation of Derived Quantities
Applied Sciences, 2022 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
Explanation in Constraint Satisfaction: A Survey [PDF]
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021 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
Applied Sciences, 2021 Many of the works conducted on algorithm selection strategies—methods that choose a suitable solving method for a particular problem—start from scratch since only a few investigations on reusable components of such methods are found in the literature ...
José C. Ortiz-Bayliss +5 more
doaj +1 more source
A Mathematical Model for Course Timetabling Problem With Faculty-Course Assignment Constraints
IEEE Access, 2021 University course timetabling problem (UCTP) includes the challenging task of generating an automated timetable for courses under resource limitations.
H. Algethami, W. Laesanklang
doaj +1 more source
Sandwiches for promise constraint satisfaction [PDF]
Algebra universalis, 2021 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 +2 more sources
Coordination via Interaction Constraints I: Local Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 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
Coherence as Constraint Satisfaction [PDF]
Cognitive Science, 1998 This paper provides a computational characterization of coherence that applies to a wide range of philosophical problems and psychological phenomena. Maximizing coherence is a matter of maximizing satisfaction of a set of positive and negative constraints.
Paul Thagard, Karsten A. Verbeurgt
openaire +1 more source
Checking Constraint Satisfaction
, 2021 We address the problem of verifying a constraint by a set of solutions S. This problem is present in almost all systems aiming at learning or acquiring constraints or constraint parameters. We propose an original approach based on MDDs. Indeed, the set of solutions can be represented by the MDD denoted by \(MDD_S\). Checking whether S satisfies a given
Victor Jung, Jean-Charles Régin
openaire +2 more sources
Promise Constraint Satisfaction and Width [PDF]
, 2022 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