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

Authors:
Michael Bartholomew;Joohyung Lee;Yunsong Meng
Affiliations:
School of Computing, Informatics and Decision Systems Engineering, Arizona State University, Tempe;School of Computing, Informatics and Decision Systems Engineering, Arizona State University, Tempe;School of Computing, Informatics and Decision Systems Engineering, Arizona State University, Tempe
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 14
Cited 1

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
A New Logical Characterisation of Stable Models and Answer Sets

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Applications of intuitionistic logic in Answer Set Programming

Theory and Practice of Logic Programming
Modular Nonmonotonic Logic Programming Revisited

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
On Reductive Semantics of Aggregates in Answer Set Programming

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
System f2lp --- Computing Answer Sets of First-Order Formulas

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A uniform integration of higher-order reasoning and external evaluations in answer-set programming

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Circumscriptive event calculus as answer set programming

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

Artificial Intelligence
Stable models and circumscription

Artificial Intelligence
Semantics and complexity of recursive aggregates in answer set programming

Artificial Intelligence
Thirteen definitions of a stable model

Fields of logic and computation
Answer sets for propositional theories

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

Well-Supported semantics for logic programs with generalized rules

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

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 Truszczynski. 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.