Strong and weak constraints in disjunctive datalog

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

Volumn 1265, Issue , 1997, Pages 2-17

  Buccafurri, Francesco ^a   Leone, Nicola ^b   Rullo, Pasquale ^c  

^a UNIVERSITY OF CALABRIA   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; INFORMATION RETRIEVAL; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; SEMANTICS;

COMPLEXITY ANALYSIS; DISJUNCTIVE DATALOG; FORMAL DEFINITION; INTEGRITY CONSTRAINTS; MODEL-THEORETIC; NP OPTIMIZATION PROBLEMS; PRIORITY LEVELS; STABLE MODEL SEMANTICS;

C (PROGRAMMING LANGUAGE);

EID: 84946745472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63255-7_2     Document Type: Conference Paper

References (22)

1. Baral, C. and Gelfond, M. (1994), Logic Programming and Knowledge Representation Journal of Logic Programming, 19/20, 73-148.
2. Ben-Eliyahu, R. and Dechter, R. (1994), Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 12, 53-87.
3. Brass, S. and Dix, J. (1995), Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation, in "Proc. of the 12th Int. Conf. on Logic Programming," Tokyo, pp. 199-213, MIT Press.
4. Decker, H., Celma, M. (1994) A slick procedure for integrity checking in deductive databases, " Proc. of the Eleventh Int. Conference on Logic Programming, S. Margherita Ligure", Italy, pp. 456 - 469, MIT Press.
5. Eiter, T., Gottlob, G. and Mannila, H. (1994), Adding Disjunction to Datalog, in "Proc. ACM PODS-94," pp. 267-278.
6. Eiter, T. and Gottlob, G. (1995), On the Computational Cost of Disjunctive Logic Programming: Propositional Case, Annals of Mathematics and Artificial Intelligence, J. C. Baltzer AG, Science Publishers, 15, 289-323.
7. Eiter, T. and Gottlob, G. (1995), The Complexity of Logic-Based Abduction, Journal of the ACM, 42, 3-42.
8. Fernández, J.A. and Minker, J. (1992), Semantics of Disjunctive Deductive Databases, in "Proc. 4th Intl. Conference on Database Theory (ICDT-92)," Berlin, pp. 21-50.
9. Garey, M., Johnson, D.S. (1979) Computers and Intractability - A Guide to the Theory of NP- Completeness, W. H. Freeman, New York.
10. Gelfond, M. and Lifschitz, V. (1991), Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9, 365-385.
11. Greco, S. (1996), Extending Datalog with Choice and Weak Constraints, in "Proc. of the Joint Conference on Declarative Programming (APPIA-GULP-PRODE’96", Donostia-San Sebastian, Spain, pp.329-340.
12. Greco, S. and Saccá, D. (1997), NP Optimization Problems in Datalog, unpublished manuscript.
13. IFIP-GI Workshop (1994), "Disjunctive Logic Programming and Disjunctive Databases," 13-th IFIP World Computer Congress.
14. Kowalski, R., Sadri, F. (1988) A theorem-proving approach to database integrity, in J. Minker (ed), Foundations of Deductive Databases and Logic Programming, 313-362, Morgan Kaufman.
15. 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.
16. Leone, N., Rullo, P., Scarcello, F. (1997) Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation, Information and Computation, Forthcoming.
17. Lloyd, J.W., Sonenberg, E.A., Topor, R.W. (1987) Integrity constraint checking in stratified databases, Journal of Logic Programming, 2, pp. 331-343.
18. Lobo, J., Minker, J. and Rajasekar, A. (1992) Foundations of Disjunctive Logic Programming MIT Press, Cambridge, MA.
19. Marek, W. and Subrahmanian, V.S. (1989), The Relationship between Logic Program Semantics and Non-Monotonic Reasoning, in "Proc. of the 6th International Conference on Logic Programming - ICLP’89," pp. 600-617, MIT Press.
20. th Conference on Automated Deduction (CADE-82)," pp. 292-308.
21. Papadimitriou, C.H. (1994), Computational Complexity, Addison-Wesley.
22. Przymusinska, H. and Przymusinski, T. (1988), Weakly Perfect Model Semantics for Logic Programs, in "Proc. Fifth Int. Conf. and Symp. on Logic Programming," pp.1106-1120.