Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68204OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325883

Daniel Le Berre, Armando Tacchella, Laurent Simon

Publication date: 24 July 2009

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

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

Mathematics Subject Classification ID

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

Related Items (3)

The complexity of pure literal elimination ⋮ Bounded semantics ⋮ A complexity perspective on entailment of parameterized linear constraints

Uses Software

• SatEx
• Chaff
• Quaffle

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