Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325883
DOI10.1007/b95238zbMath1204.68204WikidataQ56039662 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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Bounded semantics, A complexity perspective on entailment of parameterized linear constraints, The complexity of pure literal elimination
Uses Software