Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMath1122.68582OpenAlexW2483910514MaRDI QIDQ5714742

Carlos Ansótegui, Felip Manyà

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

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

Related Items

WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ MaxSAT resolution for regular propositional logic ⋮ On Inconsistent Clause-Subsets for Max-SAT Solving ⋮ Towards Robust CNF Encodings of Cardinality Constraints ⋮ Automatic generation of redundant models for permutation constraint satisfaction problems ⋮ Propagation via lazy clause generation ⋮ Mapping multivalued onto Boolean dynamics ⋮ Sequential Encodings from Max-CSP into Partial Max-SAT ⋮ Solving (Weighted) Partial MaxSAT through Satisfiability Testing ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints ⋮ Iterative and core-guided maxsat solving: a survey and assessment

Uses Software

• Chaff