TY - CHAP
T1 - Connecting first-order ASP and the logic FO(ID) through reducts
AU - Truszczynski, Miroslaw
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2012
Y1 - 2012
N2 - Recently, an answer-set programming (ASP) formalism of logic programing with the answer-set semantics has been extended to the full first-order setting. Earlier an extension of first-order logic with inductive definitions, the logic FO(ID), was proposed as a knowledge representation formalism and developed as an alternative ASP language. We present characterizations of these formalisms in terms of concepts of infinitary propositional logic. We use them to find a direct connection between the first-order ASP and the logic FO(ID) under some restrictions on the form of theories (programs) considered.
AB - Recently, an answer-set programming (ASP) formalism of logic programing with the answer-set semantics has been extended to the full first-order setting. Earlier an extension of first-order logic with inductive definitions, the logic FO(ID), was proposed as a knowledge representation formalism and developed as an alternative ASP language. We present characterizations of these formalisms in terms of concepts of infinitary propositional logic. We use them to find a direct connection between the first-order ASP and the logic FO(ID) under some restrictions on the form of theories (programs) considered.
UR - http://www.scopus.com/inward/record.url?scp=84864219293&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864219293&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-30743-0_37
DO - 10.1007/978-3-642-30743-0_37
M3 - Chapter
AN - SCOPUS:84864219293
SN - 9783642307423
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 543
EP - 559
BT - Correct Reasoning
A2 - Esra, Erdem
A2 - Joohyung, Lee
A2 - Yuliya, Lierler
A2 - David, Pearce
ER -