Enumerating All Solutions for Constraint Satisfaction Problems

DOI10.1007/978-3-540-70918-3_59zbMath1186.68224OpenAlexW2113451334MaRDI QIDQ3590974

Ilka Schnoor, Henning 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 complexityenumerationconstraints

Mathematics Subject Classification ID

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

Related Items (15)

The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I ⋮ The connectivity of Boolean satisfiability: dichotomies for formulas and circuits ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ Unnamed Item ⋮ Enumerating homomorphisms ⋮ The complexity of satisfiability for fragments of hybrid logic. I. ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ The Weight in Enumeration ⋮ Generalized modal satisfiability ⋮ The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? ⋮ Partial Polymorphisms and Constraint Satisfaction Problems ⋮ Structural tractability of enumerating CSP solutions ⋮ A Dichotomy Theorem for the Inverse Satisfiability Problem

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