Results 41 to 50 of about 15,021 (304)
Binarisation for Valued Constraint Satisfaction Problems [PDF]
SIAM Journal on Discrete Mathematics, 2017 Subsumes 1507 ...
David A. Cohen +5 more
openaire +6 more sources
Compilation-Based Approaches to Parallel Planning: An Empirical Comparison
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 Automated planning deals with finding a sequence of actions, a plan, to reach a goal. One of the possible approaches to automated planning is a compilation of a planning problem to a Boolean satisfiability problem or to a constraint satisfaction problem,
Kristýna Pantůčková, Roman Barták
doaj +1 more source
An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 In the context of Constraint Programming, a portfolio approach exploits the complementary strengths of a portfolio of different constraint solvers. The goal is to predict and run the best solver(s) of the portfolio for solving a new, unseen problem.
Roberto Amadini +2 more
doaj +1 more source
Promise constraint satisfaction problems
, 2022 The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of each constraint: a strict one and a weak one. Given the promise that a solution exists under the strict constraints,
openaire +3 more sources
A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems
Computers, 2015 Distributed constraint satisfaction problems (DisCSPs) are among the widely endeavored problems using agent-based simulation. Fernandez et al. formulated sensor and mobile tracking problem as a DisCSP, known as SensorDCSP In this paper, we adopt a ...
Abhishek Bhatia +2 more
doaj +1 more source
Constraint satisfaction problems and global cardinality constraints [PDF]
Communications of the ACM, 2010 In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a certain value.
Andrei A. Bulatov, Dániel Marx
openaire +1 more source
Hybrid Tractable Classes of Constraint Problems [PDF]
, 2017 We present a survey of complexity results for hybrid constraint satisfaction problems (CSPs) and valued constraint satisfaction problems (VCSPs). These are classes of (V)CSPs defined by restrictions that are not exclusively language-based or structure ...
Cooper, Martin C. +2 more
core +1 more source
Caterpillar Duality for Constraint Satisfaction Problems [PDF]
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008 The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems that are definable in the smallest natural recursive fragment of Datalog - monadic linear Datalog with at most one EDB per rule.
Catarina Carvalho +2 more
openaire +2 more sources
When the Decomposition Meets the Constraint Satisfaction Problem
IEEE Access, 2020 This paper explores the joint use of decomposition methods and parallel computing for solving constraint satisfaction problems and introduces a framework called Parallel Decomposition for Constraint Satisfaction Problems (PD-CSP).
Youcef Djenouri +5 more
doaj +1 more source
Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 The job-shop scheduling is one of the most studied optimization problems from the dawn of computer era to the present day. Its combinatorial nature makes it easily expressible as a constraint satisfaction problem.
Giacomo Da Col, Erich Teppan
doaj +1 more source