First-order extension of the FLP semantics

Michael Bartholomew; Joohyung Lee; Yunsong Meng

First-order extension of the FLP semantics

Michael Bartholomew, Joohyung Lee, Yunsong Meng

Computing and Augmented Intelligence, School of (IAFSE-SCAI)

Research output: Contribution to conference › Paper › peer-review

Abstract

We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczyński. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to first-order formulas containing aggregate expressions. Similar to the first-order stable model semantics by Ferraris, Lee and Lifschitz, the reformulations presented here are based on syntactic transformations that are similar to circumscription. The reformulations provide useful insights into the FLP semantics and its relationship to circumscription and the first-order stable model semantics.

Original language	English (US)
State	Published - 2019
Event	10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011 - Stanford, United States Duration: Mar 21 2011 → Mar 23 2011

Conference

Conference	10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011
Country/Territory	United States
City	Stanford
Period	3/21/11 → 3/23/11

ASJC Scopus subject areas

Software
Logic

Cite this

@conference{e413cf3494df4c8284be5c162e204d9c,

title = "First-order extension of the FLP semantics",

abstract = "We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczy{\'n}ski. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to first-order formulas containing aggregate expressions. Similar to the first-order stable model semantics by Ferraris, Lee and Lifschitz, the reformulations presented here are based on syntactic transformations that are similar to circumscription. The reformulations provide useful insights into the FLP semantics and its relationship to circumscription and the first-order stable model semantics.",

author = "Michael Bartholomew and Joohyung Lee and Yunsong Meng",

note = "Funding Information: We are grateful to anonymous referees for their useful comments on this paper. The authors were partially supported by the National Science Foundation under Grants IIS-0916116 and by the IARPA SCIL program. Publisher Copyright: {\textcopyright} 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011 ; Conference date: 21-03-2011 Through 23-03-2011",

year = "2019",

language = "English (US)",

}

TY - CONF

T1 - First-order extension of the FLP semantics

AU - Bartholomew, Michael

AU - Lee, Joohyung

AU - Meng, Yunsong

N1 - Funding Information: We are grateful to anonymous referees for their useful comments on this paper. The authors were partially supported by the National Science Foundation under Grants IIS-0916116 and by the IARPA SCIL program. Publisher Copyright: © 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

PY - 2019

Y1 - 2019

N2 - We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczyński. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to first-order formulas containing aggregate expressions. Similar to the first-order stable model semantics by Ferraris, Lee and Lifschitz, the reformulations presented here are based on syntactic transformations that are similar to circumscription. The reformulations provide useful insights into the FLP semantics and its relationship to circumscription and the first-order stable model semantics.

AB - We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczyński. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to first-order formulas containing aggregate expressions. Similar to the first-order stable model semantics by Ferraris, Lee and Lifschitz, the reformulations presented here are based on syntactic transformations that are similar to circumscription. The reformulations provide useful insights into the FLP semantics and its relationship to circumscription and the first-order stable model semantics.

UR - http://www.scopus.com/inward/record.url?scp=85088257877&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85088257877&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:85088257877

T2 - 10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011

Y2 - 21 March 2011 through 23 March 2011

ER -

First-order extension of the FLP semantics

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this