Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers

DOI10.1007/978-3-642-16242-8_9zbMath1306.68182OpenAlexW1560461246MaRDI QIDQ4933300

Katsumi Inoue, Haruki Matsunaka, Mutsunori Banbara, Naoyuki Tamura

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_9

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming ⋮ Construction of non-isomorphic covering arrays ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ Covering array EXtender ⋮ meSAT: multiple encodings of CSP to SAT

Uses Software

• MiniSat

This page was built for publication: Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers