An efficient computation of the extended generalized closed world assumption by support-for-negation sets-Reference-Cited by-同舟云学术

An efficient computation of the extended generalized closed world assumption by support-for-negation sets

Published:1994 Issue: Volume: Page:245-259
ISSN:0302-9743
Container-title:Logic Programming and Automated Reasoning
language:
Short-container-title:

Author:

Seipel Dietmar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58216-9_42.pdf

Reference23 articles.

1. A. Abdelmoty, M. Williams, N. Paton: Deduction and Deductive Databases for Geographic Data Handling, Proc. Intl. Symposium on Advances in Spatial Databases 1993 (SSD'93), pp. 443–464.

2. C. Baral, J. Lobo, J. Minker: Generalized Well-Founded Semantics for Logic Programs, Proc. Intl. Conf. on Automated Deduction 1989, pp. 102–116.

3. F. Bancilhon, R. Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies, Proc. ACM SIGMOD 1986, pp. 16–52.

4. S. Ceri, G. Gottlob, L. Tanca: Logic Programming and Databases, Springer, 1990.

5. W. Chen, D.S. Warren: A Goal-Oriented Approach to Computing Well-Founded Semantics, Proc. Joint Intl. Conf. and Symp. on Logic Prog. 1992, pp. 589–603.

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

1. Disjunctive Logic Programming: A Survey and Assessment;Computational Logic: Logic Programming and Beyond;2002

2. On the equivalence of the static and disjunctive well-founded semantics and its computation;Theoretical Computer Science;2001-05

3. Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter;Logical Foundations for Cognitive Agents;1999

4. A general approach to bottom-up computation of disjunctive semantics;Non-Monotonic Extensions of Logic Programming;1995

5. Non—Monotonic Reasoning Based on Minimal Models and its Efficient Implementation;Innovationen bei Rechen- und Kommunikationssystemen;1994