Revised stable models – a semantics for logic programs

Authors:
Luís Moniz Pereira;Alexandre Miguel Pinto
Affiliations:
Centro de Inteligência Artificial – CENTRIA, Universidade Nova de Lisboa, Caparica, Portugal;Centro de Inteligência Artificial – CENTRIA, Universidade Nova de Lisboa, Caparica, Portugal
Venue:
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Year:
2005

Citing 4
Cited 7

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
The alternating fixpoint of logic programs with negation

PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Evolving Logic Programs

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties

Fundamenta Informaticae

Layered Models Top-Down Querying of Normal Logic Programs

PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Approved models for normal logic programs

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Gödel and computability

EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
Modelling decision making with probabilistic causation

Intelligent Decision Technologies
Adaptive reasoning for cooperative agents

INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory

Fundamenta Informaticae - Logic, Language, Information and Computation
Goal-directed execution of answer set programs

Proceedings of the 14th symposium on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The distinction consists in the revision of one feature of SM, namely its treatment of odd loops, and of infinitely long support chains, over default negation. This single revised aspect, addressed by means of a Reductio ad Absurdum approach, affords a number of fruitful consequences, namely regarding existence, relevance and top-down querying, cumulativity, and implementation. The paper motivates and defines the Revised Stable Models semantics (rSM), justifying and exemplifying it. Properties of rSM are given and contrasted with those of SM. Furthermore, these results apply to SM whenever odd loops and infinitely long chains over negation are absent, thereby establishing significant, not previously known, properties of SM. Conclusions, further work, terminate the paper.