P-stable models of strong kernel programs

Authors:
Claudia Zepeda;José Luis Carballido
Affiliations:
Benemérita Universidad Atónoma de Puebla, Facultad de Ciencias de la Computación, Puebla, Puebla, Mexico;Benemérita Universidad Atónoma de Puebla, Facultad de Ciencias de la Computación, Puebla, Puebla, Mexico
Venue:
Journal of Algorithms
Year:
2009

Citing 8
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Normal forms for answer sets programming

Theory and Practice of Logic Programming
On the existence of stable models of non-stratified logic programs

Theory and Practice of Logic Programming
Pstable Theories and Preferences

CONIELECOMP '08 Proceedings of the 18th International Conference on Electronics, Communications and Computers (conielecomp 2008)
Logical Weak Completions of Paraconsistent Logics

Journal of Logic and Computation
Update sequences based on minimal generalized pstable models

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The research community has long recognized the study of non-monotonic reasoning (NMR) as a promising approach to model features of commonsense reasoning. We study one of the semantics that are useful to formalize NMR, called the p-stable semantics. We introduce three different formats for normal programs: negative normal programs, restricted negative normal programs and strong kernel programs. These forms help to simplify the search of p-stable models of the original program. One of the main results of this paper indicates that the p-stable semantics for strong kernel programs is the same as the stable semantics. This way, all the applications based on stable semantics for those kernel programs (defined in [S. Costantini, A. Provetti, Normal forms for answer set programming, J. Theory Pract. Log. Program. 5 (2005) 747-760]) that are strong kernel programs can also be based on the p-stable semantics.