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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 822 LNAI, Issue , 1994, Pages 245-259

  Seipel, Dietmar ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMS; COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; ITERATIVE METHODS; LOGIC PROGRAMMING; SEMANTICS;

ALGEBRAIC FORMULAS; CLOSED WORLD ASSUMPTION; DISJUNCTIVE LOGIC PROGRAMS; DISJUNCTIVE WELL-FOUNDED SEMANTICS; EFFICIENT COMPUTATION; ITERATION TECHNIQUES; ITERATIVE COMPUTATION; NON-MONOTONIC REASONING;

COMPUTER CIRCUITS;

EID: 4444302353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58216-9_42     Document Type: Conference Paper

References (23)

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.
6. W. Chen, D.S. Warren: Query Evaluation under the Well-Founded Semantics, Proc. ACM PODS 1993.
7. S.K. Das: Deductive Databases and Logic Programming, Addison-Wesley, 1992.
8. J. Dix: Classifying Semantics of Disjunctive Logic Programs, Proc. Joint. Intl. Conf. and Symp. on Logic Programming 1992, pp. 798-812.
9. U. Fuhrbach: Computing Answers for Disjunctive Logic Programs, Proc. ILPS Workshop on Disjunctive Logic Programs 1991.
10. J.A. Fernández, J. Minker: Theory and Algorithms for Disjunctive Deductive Databases, Programmirovanie J. 1993, Academy of Sciences of Russia.
11. M. Fitting: The Family of Stable Models, Journal of Logic Programming, vol. 17(3,4), 1993, pp. 197-225.
12. M. Gelfond, V. Lifschitz: The Stable Model Semantics for Logic Programming, Proc. Intl. Conf. and Symp. on Logic Programming 1988, pp. 1070-1080.
13. U. Güntzer, W. Kießling, R. Bayer: On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration, Proc. Intl. Conf. on Data Engineering 1987, pp. 120-129.
14. G. Köstler, W. Kießling, H. Thöne, U. Güntzer: The Differential Fixpoint Operator with Subsumption, Proc. Intl. Conf. DOOD 1993, pp. 35-48.
15. J.W. Lloyd: Foundations of Logic Programming, Springer, second edition, 1987.
16. J. Lobo, J. Minker, A. Rajasekar: Foundations of Disjunctive Logic Programming, MIT Press, 1992.
17. J. Pearl: Probabilistic Reasoning in Intelhgent Systems: Networks of Plausible Inference, Morgan Kaufman, 1988.
18. T.C. Przymusinski: Stationary Semantics for Disjunctive Logic Programs and Deductive Databases, Proc. North-American Conf. of Logic Prog. 1990, pp. 42-59.
19. D. Seipel, H. Argenton: Evaluation Techniques for Disjunctive Logic Programs, Proc. Symposium on Operations Research 1993.
20. D. Seipel: Tree-Based Fixpoint Iteration for Disjunctive Logic Programs, Proc. Workshop on Logic Prog. with Incomplete Inf., Intl. Symp. on Logic Prog. 1993.
21. D. Seipel, H. Thöne: An Apphcation of Disjunctive Logic Programming with Incomplete Information, Proc. Intl. Conf. on Expert Syst. for Development 1994.
22. J.D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I,II, Computer Science Press, 1988/89.
23. A. Van Gelder, K.A. Ross, J.S. Schlipf: The Well-Founded Semantics for General Logic Programs, JACM, vol. 38(3), 1991, pp. 620-650.