Generalized well-founded semantics for logic programs-Reference-Cited by-同舟云学术

Generalized well-founded semantics for logic programs

Published:1990 Issue: Volume: Page:102-116
ISSN:0302-9743
Container-title:10th International Conference on Automated Deduction
language:
Short-container-title:

Author:

Baral Chitta,Lobo Jorge,Minker Jack

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-52885-7_82.pdf

Reference12 articles.

1. C. Baral, J. Lobo, and J. Minker. Generalized disjunctive well-founded semantics for logic programs: Declarative semantics. Submitted to ICLP 90.

2. J. Chomicki and V. S. Subrahmanian. Generalized closed world assumption is π0 2 complete. Technical Report TR 89-036, Department of Computer Science, University of North Carolina at Chapel Hill, October 1989.

3. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5th International Conference and Symposium on Logic Programming, pages 1070–1080, Seattle, Washington, August 15–19 1988.

4. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.

5. J. Minker. On Indefinite Databases and the Closed World Assumption. In Lecture Notes in Computer Science 138, pages 292–308. Springer-Verlag, 1982.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. To Vladimir Lifschitz on His 65th Birthday;Correct Reasoning;2012

2. A Well-Founded Semantics with Disjunction;Logic Programming;2005

3. Static semantics for normal and disjunctive logic programs;Annals of Mathematics and Artificial Intelligence;1995-06

4. Overview of disjunctive logic programming;Annals of Mathematics and Artificial Intelligence;1994-03

5. An efficient computation of the extended generalized closed world assumption by support-for-negation sets;Logic Programming and Automated Reasoning;1994