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

Producción científica: Chapter › revisión exhaustiva

39 Citas (Scopus)

Resumen

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.

Idioma original	English
Título de la publicación alojada	Correct Reasoning
Subtítulo de la publicación alojada	Essays on Logic-Based AI in Honor of Vladimir Lifschitz
Editores	Erdem Esra, Lee Joohyung, Lierler Yuliya, Pearce David
Páginas	543-559
Número de páginas	17
DOI	https://doi.org/10.1007/978-3-642-30743-0_37
Estado	Published - 2012

Serie de la publicación

Nombre	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen	7265
ISSN (versión impresa)	0302-9743
ISSN (versión digital)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Acceder al documento

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

Otros archivos y enlaces

Citar esto

Truszczynski, M. (2012). Connecting first-order ASP and the logic FO(ID) through reducts. En 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. En 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).

Producción científica: Chapter › revisión exhaustiva

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. En Esra E, Joohyung L, Yuliya L, David P, editores, 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

Resumen

Serie de la publicación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto