Title: Satisfiability checking for PC(ID)
Authors: MariĆ«n, Maarten ×
Mitra, Rudradeb
Denecker, Marc
Bruynooghe, Maurice #
Issue Date: 2005
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3835 pages:565-579
Conference: Logic for Programming, Artificial Intelligence, and Reasoning edition:12 location:Montego Bay, Jamaica date:2-6 December 2005
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.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
41881.pdf Published 202KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science