Minimal founded semantics for disjunctive logic programming

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

Volumn 1730, Issue , 1999, Pages 221-235

  Greco, Sergio ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; INTELLIGENT DATABASES; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

DISJUNCTIVE DATALOG; DISJUNCTIVE LOGIC PROGRAMMING; DISJUNCTIVE STABLE MODELS; EXPRESSIVE POWER; PERFECT MODEL; STABLE MODEL SEMANTICS;

SEMANTICS;

EID: 84958609965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46767-X_16     Document Type: Conference Paper

References (22)

1. Abiteboul, S., Hull, R., Vianu, V. (1994), Foundations of Databases. Addison- Wesley.
2. S. Brass and J. Dix. Classifying semantics of disjunctive logic programs. Proc. JICSLP-92, pp. 798-812, 1993.
3. Cadoli M, T. Eiter and G. Gottlob, Default Logic as a Query Language, IEEE Transaction on Knowledge and Data Engineering, 9(3), 1997, 448-463.
4. Chandra, A., D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25, pp. 99-128, 1982.
5. T. Eiter and G. Gottlob. Complexity aspects of various semantics of disjunctive databases, Proc. Int. Conf. on Principles of Database Systems, 158-166, 1993.
6. T. Eiter, G. Gottlob and H. Mannila (1997), Disjunctive Datalog, ACM Transactions on Database Systems, 22(3):364-418, 1997
7. T. Eiter and N. Leone and D. Saccá. Expressive Power and Complexity of Partial Models for Disjunctive Deductive databases, Theoretical Computer Science, 1997.
8. Eiter T., N. Leone, C. Mateis, G. Pfeifer and F. Scarcello. The KR System dlv: Progress Report, Comparisons and Benchmarks. Proc. of 6th Int. Conf. on Princ. of Knowledge Representation, 1998, pp. 406-417.
9. Fagin R. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets, in Complexity of Computation, SIAM-AMS Proc., Vol. 7, pp. 43-73, 1974.
10. Fernandez, J. A., and Minker, J. Computing perfect models of disjunctive stratified databases. In Proc. ILPS'91 Workshop on Disjunctive Logic Programming, pp. 110-117, 1991.
11. Gelfond, M., Lifschitz, V. The Stable Model Semantics for Logic Programming, in Proc. of Fifth Conf. on Logic Programming, pp. 1070-1080, 1988.
12. Gelfond, M. and Lifschitz, V. (1991), Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9, 365-385.
13. Greco, S., Binding Propagation in Disjunctive Databases, Proc. Int. Conf. on Very Large Data Bases, 1997.
14. Greco, S., Strongly founded semantics for disjunctive logic programming, Technical Report, 1999.
15. Leone, N., P. Rullo, P. and F. Scarcello. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation, Information and Computation, Academic Press, Vol. 135, No. 2, June 15, pp. 69-112, 1997.
16. Marek, W., Truszczyński, M., Autoepistemic Logic, Journal of the ACM, 38, 3, pp. 518-619, 1991.
17. Minker, J. On Indeńite Data Bases and the Closed World Assumption, in “Proc. of the 6th Conference on Automated Deduction (CADE-82)," pp. 292-308, 1982.
18. Przymusinski, T. 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, 1988.
19. Przymusinski, T. Stable Semantics for Disjunctive Programs, New Generation Computing, 9, 401-424, 1991.
20. D. Saccà. The Expressive Powers of Stable Models for Bound and Unbound DA- TALOG Queries. Journal of Computer and System Sciences, Vol. 54, No. 3, June 1997, pp. 441-464.
21. Stockmeyer, L.J. The Polynomial-Time Hierarchy. Theoretical Computer Science, 3, pp. 1-22, 1977.
22. Vardi M.Y., "The Complexity of Relational Query Languages", Proc. ACM Symp. on Theory of Computing, pp. 137-146, 1982.