Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMath1122.68407OpenAlexW2483910514MaRDI QIDQ5714771

Nadia Creignou, Heribert Vollmer, Miki Hermann, Philippe Chapdelaine, Michael Bauland

Publication date: 16 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11527695

Mathematics Subject Classification ID

Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Tractable counting of the answers to conjunctive queries ⋮ The complexity of weighted counting for acyclic conjunctive queries ⋮ The complexity of problems for quantified constraints ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

This page was built for publication: Theory and Applications of Satisfiability Testing