Name
Abstract | ||
|---|---|---|
We investigate the satisfiability problem, SAT(ID), of an extension of propositional logic with inductive definitions. We demonstrate how to extend existing SAT solvers to become SAT(ID) solvers, and provide an implementation on top of MiniSat. We also report on a performance study, in which our implementation exhibits the expected benefits: full use of the underlying SAT solver's potential. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-79719-7_20 | SAT |
Keywords | Field | DocType |
satisfiability problem,underlying sat solver,sat solvers,inductive definition,propositional logic,full use,performance study,expected benefit,sat solver,satisfiability | Discrete mathematics,#SAT,Programming language,Computer science,Boolean satisfiability problem,Satisfiability,Propositional calculus,DPLL algorithm | Conference |
Volume | ISSN | ISBN |
4996 | 0302-9743 | 3-540-79718-1 |
Citations | PageRank | References |
29 | 0.89 | 22 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maarten Mariën | 1 | 96 | 5.81 |
| Johan Wittocx | 2 | 109 | 9.37 |
| Marc Denecker | 3 | 1626 | 106.40 |
| Maurice Bruynooghe | 4 | 2767 | 226.05 |