Abstract
In recent years there has been an increasing interest in extensions of the logic programming paradigm beyond the class of normal logic programs motivated by the need for a satisfactory respresentation and processing of knowledge. An important problem in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the ‘intended’ partial models of extended generalized logic programs which is a conservative extension of the stationary semantics for normal logic programs of [13], [14] and generalizes the WFSX-semantics of [12]. The presented preference criterion defines a partial model of an extended generalized logic program as intended if it is generated by a stationary chain. The GWFSX-semantics is defined by the set-theoretical intersection of all stationary generated models, and thus generalizes the results from [9] and [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.J. Alferes, L.M. Pereira. Reasoning with Logic Programming, LNAI vol. 1111, 1996, Springer Lecture Notes in Artificial Intelligence
J. J. Alferes, H. Herre, L.M. Pereira. Partial Models of Extended Generalized Logic Programs, Report Nr. (2000), University of Leipzig
S. Brass and J. Dix. Characterizing D-WFS. Confluence and Iterated GCWA. Logics in Artificial Intelligence, Jelia’96, p. 268–283, 1996, Srpinger LNCS 1121
J. Engelfriet and H. Herre. Generated Preferred Models and Extensions of Nonmonotonic Systems; Logic Programming, p. 85–99, Proc. of the 1997 International Symposium on LP, J. Maluszinski (ed.), The MIT Press, 1997
J. Engelfriet and H. Herre. Stable Generated Models, Temporal Logic and Disjunctive Defaults, Journal of Logic Programming 41: 1–25 (1999)
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, Proc. of ICLP, pages 1070–1080. MIT Press, 1988.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. Proc. of ICLP’90, pages 579–597. MIT Press, 1990.
M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.
H. Herre and G. Wagner. Stable Models are Generated by a Stable Chain. Journal of Logic Programming, 30(2): 165–177, 1997
V. Lifschitz, L.R. Tang and H. Turner. Nested Expressions in Logic Programs, Annals of Mathematics and A.I., to appear (1999)
D. Pearce. Stable inference as intuitionistic validity, Journal of Logic Programming 38, 79–91 (1999)
L.M. Pereira, J.J. Alferes. Wellfounded semantics for logic programs with explicit negation. In B. Neumann:(ed.) European Conference on AI, 102-106, Wien, 1992
T.C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.
T.C. Przymusinski. Autoepsitemic Logic of Knolwedge and Belief. Proc. of the 12th Nat. Conf. on A.I.,AAAI’ 94, 952–959
T.C. Przymusinski. Well-founded and Stationary Models of Logic Programs; Annals of Mathematics and Artificial Intelligence, 12 (1994), 141–187
T.C. Przymusinski. Super Logic Programs and Negation as Belief. In: R. Dyckhoff, H. Herre, P. Schroeder-Heister, editors, Proc. of the 5th Int. Workshop on Extensions of Logic Programming, Springer LNAI 1050, 229–236
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alferes, J.J., Herre, H., Pereira, L.M. (2000). Partial Models of Extended Generalized Logic Programs. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive