DATALOG with nested rules

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

Volumn 1471 LNAI, Issue , 1998, Pages 52-65

  Greco, Sergio ^a   Leone, Nicola ^b   Cello, Francesco Scar ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING;

DATALOG; DISJUNCTIVE DATALOG; EXPRESSIVE POWER; IN-DEPTH ANALYSIS; REAL WORLD SITUATIONS;

COMPUTER CIRCUITS;

EID: 84867815249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054789     Document Type: Conference Paper

References (27)

1. Abiteboul, S., Hull, R., Vianu, V. (1995), Foundations of Databases. Addison-Wesley.
2. Baral, C. and Gelfond, M. (1994), Logic Programming and Knowledge Representation Journal of Logic Programming, 19/20, 73-148.
3. S. Brass and J. Dix (1997), Characterizations of the Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3):207-228.
4. S. Brass, J. Dix, and T.C. Przymusinski (1996), Super Logic Programs. In "Proc. of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96)", Cambridge, MA, USA, Morgan Kaufmann, pp. 529-540.
5. M. Cadoli and M. Schaerf (1993), A Survey of Complexity Results for Nonmonotonic Logics, Journal of Logic Programming, Vol. 17, pp. 127-160.
6. Chandra, A., Harel, D. (1982), Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25:99-128.
7. Eiter, T., Gottlob, G. and Mannila, H. (1994), Adding Disjunction to Datalog, Proc. ACM PODS-94, pp. 267-278.
8. T. Eiter and G. Gottlob and H. Mannila (1997), Disjunctive Datalog, ACM Transactions on Database Systems, 22(3):364-418.
9. Fagin R. (1974), Generalized First-Order Spectra and Polynomial-Time Recognizable Sets, Complexity of Computation, SIAM-AMS Proc, Vol. 7, pp. 43-73.
10. Gelfond, M., Lifschitz, V. (1988), The Stable Model Semantics for Logic Programming, in Proc. of Fifth Conf. on Logic Programming, pp. 1070-1080, MIT Press.
11. Gelfond, M. and Lifschitz, V. (1991), Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9, 365-385.
12. Gelfond, M. and Son, T.C., Reasoning with Prioritized Defaults, Proc. of the Workshop Logic Programming and Knowledge Representation - LPKR'97, Port Jefferson, New York, October 1997.
13. Gottlob, G., Complexity Results for Nonmonotonic Logics, Journal of Logic and Computation, Vol. 2, N. 3, pp. 397-425, 1992.
14. Greco, S.(1990), Binding Propagation in Disjunctive Databases, Proc. Int. Conf. on Very Large Data Bases, New York City.
15. Herre H., and Wagner G. (1997), Stable Models Are Generated by a Stabel Chain, Journal of Logic Programming, 30(2): 165-177.
16. Leone, N., Rullo, P., Scarcello, F. (1995) Declarative and Fixpoint Characterizations of Disjunctive Stable Models, In "Proceedings of International Logic Programming Symposium (ILPS'95)", Portland, Oregon, pp. 399-413, MIT Press.
17. Leone, N., Rullo, P., Scarcello, F. (1997) Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation, Information and Computation, Academic Press, Vol. 135, No. 2, June 15, 1997, pp. 69-112.
18. Marek, W., Truszczyński, M., Autoepistemic Logic, Journal of the ACM, 38, 3, 1991, pp. 518-619.
19. th Conference on Automated Deduction (CADE-82)" pp. 292-308.
20. L. Pereira, J. Alferes, and J. Aparicio (1992), Well founded semantics for logic programs with explicit negation. In "Proc. of European Conference on AI".
21. Przymusinski, T. (1988), On the Declarative Semantics of Deductive Databases and Logic Programming, In "Foundations of deductive databases and logic programming" Minker, J. ed., ch. 5, pp.193-216, Morgan Kaufman, Washington, D.C.
22. Przymusinski, T. (1991), Stable Semantics for Disjunctive Programs, New Generation Computing, 9, 401-424.
23. D. Sacca. The Expressive Powers of Stable Models for Bound and Unbound DAT-ALOG Queries. Journal of Computer and System Sciences, Vol. 54, No. 3, June 1997, pp. 441-464.
24. Schlipf, J.S., The Expressive Powers of Logic Programming Semantics, Proc. ACM Symposium on Principles of Database Systems 1990, pp. 196-204.
25. Stockmeyer, L.J. (1977), The Polynomial-Time Hierarchy. Theoretical Computer Science, 3:1-22.
26. Van Gelder, A., Ross, K. A. and Schlipf, J. S. (1991), The Weil-Founded Semantics for General Logic Programs, Journal of ACM, 38(3), 620-650.
27. Vardi, M. (1982), Complexity of relational query languages, In "Proceedings 14th ACM STOC" pp. 137-146.