A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Constraint relaxation may be perfect
Artificial Intelligence
Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Fast parallel constraint satisfaction
Artificial Intelligence
Characterising tractable constraints
Artificial Intelligence
Homomorphisms to oriented paths
Discrete Mathematics
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Existence of Homomorphisms to Oriented Cycles
SIAM Journal on Discrete Mathematics
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Constraint Satisfaction Problems and Finite Algebras
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Constraints, consistency and closure
Artificial Intelligence
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
The complexity of constraint satisfaction games and QCSP
Information and Computation
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We study which constraint satisfaction problems (CSPs) are solvable in NL. In particular, we identify a general condition called bounded path duality, that explains all the families of CSPs previously known to be in NL. Bounded path duality captures the class of constraint satisfaction problems that can be solved by linear Datalog programs, i.e., Datalog programs with at most one IDBin the body of each rule. We obtain several alternative characterizations of bounded path duality. We also address the problem of deciding which constraint satisfaction problems have bounded path duality. In this direction we identify a subclass of bounded path duality problems, called (1,k)-path duality problems for which membership is decidable. Finally, we study which closure operations guarantee bounded path duality. We show that closure under any operation in the pseudovariety generated by the class of dual discriminator operations is a sufficient condition for bounded path duality.