First-order extension of the FLP stable model semantics via modified circumscription

Michael Bartholomew, Joohyung Lee, Yunsong Meng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

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. In the same spirit as the first-order stable model semantics proposed by Ferraris, Lee and Lifschitz, the semantics proposed 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 languageEnglish (US)
Title of host publicationIJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence
Pages724-730
Number of pages7
DOIs
StatePublished - Dec 1 2011
Event22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 - Barcelona, Catalonia, Spain
Duration: Jul 16 2011Jul 22 2011

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)1045-0823

Other

Other22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
CountrySpain
CityBarcelona, Catalonia
Period7/16/117/22/11

    Fingerprint

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Bartholomew, M., Lee, J., & Meng, Y. (2011). First-order extension of the FLP stable model semantics via modified circumscription. In IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence (pp. 724-730). (IJCAI International Joint Conference on Artificial Intelligence). https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-128