Search

Search Results

1. HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems

   Evaluating conjunctive queries (CQs) is NP-hard in general; however, acyclic CQs or nearest acyclic CQs can be evaluated in polynomial time. Many...

   Zineb Younsi, Kamal Amroun, ... Sofia Bennai in Applied Intelligence

   Article 27 December 2022
   

2. Tractability in constraint satisfaction problems: a survey

   Even though the Constraint Satisfaction Problem (CSP) is NP-complete, many tractable classes of CSP instances have been identified. After discussing...

   Clément Carbonnel, Martin C. Cooper in Constraints

   Article 21 July 2015

3. Space Saving by Dynamic Algebraization

   Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually...

   Martin Fürer, Huiwen Yu in Computer Science - Theory and Applications

   Conference paper 2014
   

4. Ant Colony Optimization for Tree Decompositions

   Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width....

   Thomas Hammerl, Nysret Musliu in Evolutionary Computation in Combinatorial Optimization

   Conference paper 2010
   

5. Tree-Width for First Order Formulae

   We introduce tree-width for first order formulae ϕ, fotw(ϕ). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover,...

   Isolde Adler, Mark Weyer in Computer Science Logic

   Conference paper 2009
   

6. The Structure of Tractable Constraint Satisfaction Problems

   We give a survey of recent results on the complexity of constraint satisfaction problems. Our main emphasis is on tractable structural restrictions.

   Martin Grohe in Mathematical Foundations of Computer Science 2006

   Conference paper 2006
   

7. DAG-Width and Parity Games

   Tree-width is a well-known metric on undirected graphs that measures how tree-like a graph is and gives a notion of graph decomposition that proves...

   Dietmar Berwanger, Anuj Dawar, ... Stephan Kreutzer in STACS 2006

   Conference paper 2006
   

8. Tractability by Approximating Constraint Languages

   A constraint satisfaction problem instance consists of a collection of variables that need to have values assigned to them. The assignments are...

   Martin J. Green, David A. Cohen in Principles and Practice of Constraint Programming – CP 2003

   Conference paper 2003
   

9. A Constraint Directed Model for Partial Constraint Satisfaction Problems

   For many constraint satisfaction problems, finding complete solutions is impossible (i.e. problems may be over-constrained). In such cases, we want a...

   Sivakumar Nagarajan, Scott Goodwin, Abdul Sattar in Advances in Artificial Intelligence

   Conference paper 2000