Satisfiability checking for PC(ID (2005)
| Venue: | In LPAR |
| Citations: | 7 - 2 self |
BibTeX
@INPROCEEDINGS{Mariën05satisfiabilitychecking,
author = {Maarten Mariën and Rudradeb Mitra and Marc Denecker and Maurice Bruynooghe},
title = {Satisfiability checking for PC(ID},
booktitle = {In LPAR},
year = {2005},
pages = {565--579},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 MidL, experimentally validating our approach. 1
