Connecting first-order ASP and the logic FO(ID) through reducts

Miroslaw Truszczynski

doi:10.1007/978-3-642-30743-0_37

Connecting first-order ASP and the logic FO(ID) through reducts

Miroslaw Truszczynski

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

37 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Correct Reasoning
Subtitle of host publication	Essays on Logic-Based AI in Honor of Vladimir Lifschitz
Editors	Erdem Esra, Lee Joohyung, Lierler Yuliya, Pearce David
Pages	543-559
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-642-30743-0_37
State	Published - 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7265
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-30743-0_37

Cite this

Truszczynski, M. (2012). Connecting first-order ASP and the logic FO(ID) through reducts. In E. Esra, L. Joohyung, L. Yuliya, & P. David (Eds.), Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz (pp. 543-559). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7265). https://doi.org/10.1007/978-3-642-30743-0_37

Truszczynski, Miroslaw. / Connecting first-order ASP and the logic FO(ID) through reducts. Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz. editor / Erdem Esra ; Lee Joohyung ; Lierler Yuliya ; Pearce David. 2012. pp. 543-559 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{9960d5de34cd4acfb331bd932a53f4d2,

title = "Connecting first-order ASP and the logic FO(ID) through reducts",

abstract = "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.",

author = "Miroslaw Truszczynski",

year = "2012",

doi = "10.1007/978-3-642-30743-0\_37",

language = "English",

isbn = "9783642307423",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "543--559",

editor = "Erdem Esra and Lee Joohyung and Lierler Yuliya and Pearce David",

booktitle = "Correct Reasoning",

}

Truszczynski, M 2012, Connecting first-order ASP and the logic FO(ID) through reducts. in E Esra, L Joohyung, L Yuliya & P David (eds), Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7265, pp. 543-559. https://doi.org/10.1007/978-3-642-30743-0_37

Connecting first-order ASP and the logic FO(ID) through reducts. / Truszczynski, Miroslaw.
Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz. ed. / Erdem Esra; Lee Joohyung; Lierler Yuliya; Pearce David. 2012. p. 543-559 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7265).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Connecting first-order ASP and the logic FO(ID) through reducts

AU - Truszczynski, Miroslaw

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 - https://www.scopus.com/pages/publications/84864219293

UR - https://www.scopus.com/pages/publications/84864219293#tab=citedBy

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 -

Truszczynski M. Connecting first-order ASP and the logic FO(ID) through reducts. In Esra E, Joohyung L, Yuliya L, David P, editors, Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz. 2012. p. 543-559. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-30743-0_37

Connecting first-order ASP and the logic FO(ID) through reducts

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this