Enumerating All Solutions for Constraint Satisfaction Problems

DOI10.1007/978-3-540-70918-3_59zbMATH Open1186.68224OpenAlexW2113451334MaRDI QIDQ3590974FDOQ3590974

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/

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
• A general framework for enumerating equivalence classes of solutions

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)

Cited In (19)

• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• A general framework for enumerating equivalence classes of solutions
• The complexity of satisfiability for fragments of hybrid logic. I.
• A Dichotomy Theorem for the Inverse Satisfiability Problem
• Title not available (Why is that?)
• Generalized modal satisfiability
• Enumerating homomorphisms
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
• Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
• Structural tractability of enumerating CSP solutions
• Title not available (Why is that?)
• The Weight in Enumeration
• Solution Enumeration for Projected Boolean Search Problems
• The connectivity of Boolean satisfiability: dichotomies for formulas and circuits
• Enriching Solutions to Combinatorial Problems via Solution Engineering
• Enumerating all solutions of a Boolean CSP by non-decreasing weight
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
• Partial Polymorphisms and Constraint Satisfaction Problems

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)