Stable models and circumscription

Authors:
Paolo Ferraris;Joohyung Lee;Vladimir Lifschitz
Affiliations:
Google, Inc., 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States;Department of Computer Science and Engineering, Arizona State University, 699 South Mill Avenue, Tempe, AZ 85281, United States;Department of Computer Sciences, University of Texas at Austin, 1 University Station C0500, Austin, TX 78712, United States
Venue:
Artificial Intelligence
Year:
2011

Citing 23
Cited 29

Semantical considerations on nonmonotonic logic

Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
Pointwise circumscription

Readings in nonmonotonic reasoning
A study of nonmonotonic reasoning

A study of nonmonotonic reasoning
A logic of knowledge and justified assumptions

Artificial Intelligence
Tight, consistent, and computable completions for unrestricted logic programs

Journal of Logic Programming
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Extending and implementing the stable model semantics

Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions

EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
A New Logical Characterisation of Stable Models and Answer Sets

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers

Eighteenth national conference on Artificial intelligence
Tight logic programs

Theory and Practice of Logic Programming
Twelve Definitions of a Stable Model

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1

Theory and Practice of Logic Programming
A reductive semantics for counting and choice in answer set programming

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
From answer set logic programming to circumscription via logic of GK

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Loop formulas for circumscription

Artificial Intelligence
Symmetric splitting in the general theory of stable models

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A characterization of strong equivalence for logic programs with variables

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Answer sets for propositional theories

LPNMR'05 Proceedings of the 8th 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
Symmetric splitting in the general theory of stable models

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Circumscriptive event calculus as answer set programming

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Translating first-order causal theories into answer set programming

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
John McCarthy's legacy

Artificial Intelligence
On the minimality of stable models

Logic programming, knowledge representation, and nonmonotonic reasoning
Integrating rules and ontologies in the first-order stable model semantics

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Answer set programming at a glance

Communications of the ACM
Towards HIPAA-compliant healthcare systems

Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium
On elementary loops of logic programs

Theory and Practice of Logic Programming
Datalog programs and their stable models

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
First-order stable model semantics and first-order loop formulas

Journal of Artificial Intelligence Research
First-order extension of the FLP stable model semantics via modified circumscription

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Translating first-order theories into logic programs

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Enhancing directory virtualization to detect insider activity

Security and Communication Networks
Lifschitz and circumscription

Correct Reasoning
Reformulating action language C+ in answer set programming

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

Correct Reasoning
Well-Supported semantics for logic programs with generalized rules

Correct Reasoning
Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming

Journal of Artificial Intelligence Research
Relational theories with null values and non-herbrand stable models

Theory and Practice of Logic Programming
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues

Theory and Practice of Logic Programming
Module theorem for the general theory of stable models

Theory and Practice of Logic Programming
RDL: enhancing description logic with rules

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Functional stable model semantics and answer set programming modulo theories

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Action language BC: preliminary report

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Answer set programming modulo theories and reasoning about continuous changes

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
First-order expressibility and boundedness of disjunctive logic programs

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Relating constraint answer set programming languages and algorithms

Artificial Intelligence

Quantified Score

Hi-index	0.02

Visualization

Abstract

The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming and, unlike the original definition, refers neither to grounding nor to fixpoints. It is based on a syntactic transformation similar to parallel circumscription.