Lecture notes in computer science vol:4996 pages:211-224
SAT 2008 - Theory and Applications of Satisfiability Testing edition:11 location:Guangzhou, P. R. China date:12-15 May 2008
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.