A new perspective on stable models

Authors:
Paolo Ferraris;Joohyung Lee;Vladimir Lifschitz
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, TX;Dept. of Computer Science and Engineering, Arizona State University, Tempe, AZ;Department of Computer Sciences, University of Texas at Austin, Austin, TX
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 19
Cited 58

Foundations of logic programming

Foundations of logic programming
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
Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)
On the logic of causal explanation

Artificial Intelligence
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
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
A New Logical Characterisation of Stable Models and Answer Sets

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Tight logic programs

Theory and Practice of Logic Programming
Weight constraints as nested expressions

Theory and Practice of Logic Programming
Loop formulas for circumscription

Artificial Intelligence
A generalization of the Lin-Zhao theorem

Annals of Mathematics and Artificial Intelligence
From answer set logic programming to circumscription via logic of GK

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Causal theories of action and change

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Answer sets for propositional theories

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

Strongly Equivalent Temporal Logic Programs

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Twelve Definitions of a Stable Model

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Partial Functions and Equality in Answer Set Programming

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Quantified Equilibrium Logic and Foundations for Answer Set Programs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Program Correspondence under the Answer-Set Semantics: The Non-ground Case

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Safe Formulas in the General Theory of Stable Models (Preliminary Report)

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction

Journal of Computer Science and Technology
A Revised Concept of Safety for General Answer Set Programs

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
On Reductive Semantics of Aggregates in Answer Set Programming

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A First Order Forward Chaining Approach for Answer Set Computing

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Weight Constraint Programs with Functions

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
The semantics of variables in action descriptions

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Credulous resolution for answer set programming

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A reductive semantics for counting and choice in answer set programming

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
From answer set logic programming to circumscription via logic of GK

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
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
Normal Form Nested Programs

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
A characterization of strong equivalence for logic programs with variables

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Quantified equilibrium logic and hybrid rules

RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Minimal logic programs

ICLP'07 Proceedings of the 23rd international conference on Logic programming
A normal form for linear temporal equilibrium logic

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
A logical semantics for description logic programs

JELIA'10 Proceedings of the 12th European conference on Logics in artificial 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
Stable models and circumscription

Artificial Intelligence
From answer set logic programming to circumscription via logic of GK

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

Artificial Intelligence
Formalising the Fisherman's Folly puzzle

Artificial Intelligence
Loop-separable programs and their first-order definability

Artificial Intelligence
Logic programs with propositional connectives and aggregates

ACM Transactions on Computational Logic (TOCL)
A logical characterisation of ordered disjunction

AI Communications - Answer Set Programming
A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there*

Theory and Practice of Logic Programming
Functional answer set programming

Theory and Practice of Logic Programming
Thirteen definitions of a stable model

Fields of logic and computation
Answer set programming's contributions to classical logic: an analysis of ASP methodology

Logic programming, knowledge representation, and nonmonotonic reasoning
Answer set; programming?

Logic programming, knowledge representation, and nonmonotonic reasoning
Weight constraint programs with evaluable functions

Annals of Mathematics and Artificial Intelligence
The modal logic of equilibrium models

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Synonymous theories and knowledge representations in answer set programming

Journal of Computer and System Sciences
On elementary loops of logic programs

Theory and Practice of Logic Programming
First-order stable model semantics and first-order loop formulas

Journal of Artificial Intelligence Research
Interpolable formulas in equilibrium logic and answer set programming

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
To vladimir lifschitz on his 65th birthday

Correct Reasoning
Privacy preservation using multi-context systems and default logic

Correct Reasoning
From turner's logic of universal causation to the logic of GK

Correct Reasoning
Reformulating action language C+ in answer set programming

Correct Reasoning
Normal Form Nested Programs

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
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
Module theorem for the general theory of stable models

Theory and Practice of Logic Programming
Tableau Calculi for Logic Programs under Answer Set Semantics

ACM Transactions on Computational Logic (TOCL)
Answer set programming

RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
FQHT: the logic of stable models for logic programs with intensional functions

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.02

Visualization

Abstract

The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to 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 (including disjunctive rules, choice rules and conditional literals) and, unlike the original definition, refers neither to grounding nor to fixpoints. Rather, it is based on a syntactic transformation, which turns a logic program into a formula of second-order logic that is similar to the formula familiar from the definition of circumscription.