Lecture notes in computer science vol:3835 pages:565-579
Logic for Programming, Artificial Intelligence, and Reasoning edition:12 location:Montego Bay, Jamaica date:2-6 December 2005
The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logic programming, our algorithm integrates techniques from SAT and ASP. We report on a prototype system, called MIDL, experimentally validating our approach.