Satisfiability Checking for PC(ID)

Abstract 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 M id L, experimentally validating our approach.

Authors

• Maarten Mariën
• Rudradeb Mitra
• Marc Denecker
• Maurice Bruynooghe

Keywords

No keywords are indexed for this paper.