Enumerating All Solutions for Constraint Satisfaction Problems

DOI10.1007/978-3-540-70918-3_59MaRDI QIDQ3590974zbMATHOpenAlexFDO

Authors Henning Schnoor, Ilka Schnoor

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2006/804/

zbMATH Keywords

computational complexityconstraintsenumeration

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Solution Enumeration by Optimality in Answer Set Programming
• Counting constraint satisfaction problems
• Counting constraint satisfaction problems
• Counting the number of solutions for instances of satisfiability
• Full Constraint Satisfaction Problems
• Theory and Applications of Satisfiability Testing
• Solving quantified constraint satisfaction problems
• Improved algorithms for counting solutions in constraint satisfaction problems
• Constraint Satisfaction

Cited in

(18)

• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• Enumerating homomorphisms
• Solution Enumeration for Projected Boolean Search Problems
• scientific article; zbMATH DE number 6829393 (Why is no real title available?)
• Generalized modal satisfiability
• A dichotomy theorem for the inverse satisfiability problem
• Enriching Solutions to Combinatorial Problems via Solution Engineering
• The tractability of model-checking for LTL: the good, the bad, and the ugly fragments
• Partial Polymorphisms and Constraint Satisfaction Problems
• Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Enumerating all solutions of a Boolean CSP by non-decreasing weight
• Structural tractability of enumerating CSP solutions
• scientific article; zbMATH DE number 7536562 (Why is no real title available?)
• The complexity of satisfiability for fragments of hybrid logic. I.
• The connectivity of Boolean satisfiability: dichotomies for formulas and circuits
• The weight in enumeration

This page was built for publication: Enumerating All Solutions for Constraint Satisfaction Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590974)