Minimal model generation for refined answering of generalized queries in disjunctive deductive databases

Data and Knowledge Engineering

Volumn 34, Issue 3, 2000, Pages 219-249

  Yahya, Adnan H ^a,b  

^a BIRZEIT UNIVERSITY   (Palestine)

^b Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; DATA STRUCTURES; MATHEMATICAL MODELS;

DISJUNCTIVE DEDUCTIVE DATABASES; NONMONOTONIC REASONING;

QUERY LANGUAGES;

EID: 0034259214     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0169-023X(00)00016-1     Document Type: Article

References (45)

1. S. Abdennadher, H. Schütz, Model generation with existentially quantified variables and constraints, in: Proceedings of the Sixth International Conference on Algebraic and Logic Programming, LNCS, Lecture Notes in Computer Science, vol. 1298, Springer, Brelin, 1997.
2. P. Baumgartner, Hyper tableaux - the next generation, in: H. de Swaart (Ed.), Proceedings of the Conference on Automated Reasoning with Analytic Tableaux and Related Methods, LNAI, Lecture Notes in Artificial Intelligence, vol. 1397, Springer, Berlin, 1998.
3. P. Baumgartner, U. Furbach, I. Niemelä, Hyper tableaux, in: Proceedings of the JELIA96, LNAI, Lecture Notes in Artificial Intelligence, vol. 1126, Springer, Berlin, 1996.
4. P. Baumgartner, U. Furbach, F. Stolzenburg, Computing answers with model elimination, Artificial Intelligence 90 (1997) 135-176.
5. G. Bossu, P. Siegel, Saturation nonmonotonic reasoning and the closed world assumption, Artificial Intelligence 25 (1) (1985) 13-63.
6. S. Brass, U. Lipeck, Generalized bottom-up query evaluation, in: Proceedings of the Third International Conference on Extending Database Technology, LNCS, Lecture Notes in Computer Science, vol. 580, Springer, Berlin, 1992, pp. 88-103.
7. F. Bry, A. Yahya, Minimal model generation with positive unit hyper-resolution tableaux, in: Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI, Lecture Notes in Artificial Intelligence, vol. 1071, Springer, Berlin, 1996, pp. 143-159.
8. F. Bry, A. Yahya, Positive unit hyperresolution tableaux for minimal model generation, Journal of Automated Reasoning 25 (1) (2000) 35-82.
9. F. Buccafurri, N. Leone, P. Rullo, Strong and weak constraints in disjunctive datalog, in: Proceedings of the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning, LNCS, Lecture Notes in Computer Science, vol. 1265, Springer, Berlin, 1997, pp. 2-17.
10. T. Chou, M. Winslett, A model-based belief revision system, Journal of Automated Reasoning 12 (1994) 157-208.
11. M. Codish, Efficient goal directed bottom-up evaluation of logic programs, Journal of Logic Programming 38 (3) (1999) 354-370.
12. G. Dong, S. Jianwen, R. Topor, Nonrecursive incremental evaluation of datalog queries, Annals of Mathematics and Artificial Intelligence 14 (1) (1995) 187-223.
13. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, F. Scarcello, Progress report on the disjunctive deductive database dystem dlv, in: Proceedings of FQAS 1998, LNAI, Lecture Notes in Artificial Intelligence, vol. 1495, Springer, Berlin, 1998, pp. 148-163.
14. J.A. Fernández, J. Minker, Bottom-up computation of perfect models for disjunctive stratified theories, Journal of Logic Programming 25 (1) (1995) 33-50.
15. D. Fuchs, M. Fuchs, Cooperation between top-down and bottom-up theorem provers, Journal of Artificial Intelligence Research 10 (1999) 169-198.
16. M. Gelfond, H. Przymusinska, T.C. Przymusinski, The extended closed world assumption and its relation to parallel circumscription, in: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986, pp. 133-139.
17. P. Godfrey, J. Grant, J. Gryz, J. Minker, Integrity constraints: semantics and applications, in: J. Chomicki, G. Saake (Eds.), Logics for Databases and Information Systems, Kluwer Academic Publishers, Dordrecht, 1998 (Chapter 9).
18. J. Grant, J. Horty, J. Lobo, J. Minker, View updates in disjunctive deductive databases, Journal of Automated Reasoning 11 (1993) 249-267.
19. A.C. Kakas, R.A. Kowalski, F. Toni, Abductive logic programming, Journal of Logic and Computation 2 (6) (1993) 719-770.
20. R.A. Kowalski, Problems and promises of computational logic, Lecture Notes in Computer Science Series, Springer, Berlin, 1990, pp. 80-95.
21. K. Liu, R. Sunderraman, Indefinite and maybe information in relational databases, ACM Transactions on Database Systems 15 (1) (1990) 1-39.
22. K.C. Liu, R. Sunderraman, A generalized relational model for indefinite and maybe information, IEEE Transactions on Knowledge and Data Engineering (1991) 65-77.
23. D.W. Loveland, D. Reed, D. Wilson, Satchmore: Satchmo with relevancy, Journal Automated Reasoning 14 (1995) 349-363.
24. J. Lobo, J. Minker, A. Rajasekar, Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992.
25. W. Lu, Nonmonotonic reasoning based on minimal model generation and its implementation, Ph.D. Thesis, Koblenzer Schriften zur Informatik 11, Fölbach Verlag, Koblenz, 1999.
26. R. Manthey, F. Bry, Satchmo: a theorem prover implemented in prolog, in: Proceedings of the CADE'9, 1988, pp. 456-459.
27. J. Minker, On indefinite databases and the closed world aissumption, Lecture Notes in Computer Science 138, Springer, Berlin, 1982, pp. 292-308.
28. J. Minker, J. Grant, Answering queries in indefinite databases and the null value problem, in: P. Kanellakis (Ed.), Advances in Computing Research, 1986, pp. 247-267.
29. I. Niemelä, A tableau calculus for minimal model measoning, in: Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI, Lecture Notes in Artificial Intelligence, vol. 1071, Springer, Brelin, 1996, pp. 278-294.
30. Y. Ohta, K. Inoue, R. Hasegawa, On the relationship between non-horn magic sets and relevancy testing, in: Proceedings of CADE-15, LNAI, Lecture Notes in Artificial Intelligence, vol. 1421, Springer, Berlin, 1998, pp. 333-348.
31. D. Reed, D. Loveland, B. Smith, An alternative characterization of disjunctive logic programs, in: Proceedings of the ILPS'91 Workshop on Disjunctive Logic Programs, 1991, pp. 55-68.
32. R. Reiter, On closed world databases, in: H. Gallaire, J. Minker (Eds.), Logic and Data Bases, Plenum Press, New York, 1978, pp. 55-76.
33. R. Reiter, On asking what a database knows, in: J. Lloyd (Ed.), Proceedings of the Symposium on Computational Logic, Lecture Notes in Computer Science, 1990.
34. F. Sadri, R. Kowalski, A theorem proving approach to database integrity, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988.
35. D. Seipel, Efficient reasoning in disjunctive deductive databases, Habilitation Thesis, Fakultät für Informatik, Universität Tübingen, 1995.
36. M. Suchenek, First-order syntactic characterizations of minimal entailment domain minimal entailment and herbrand entailment, Journal of Automated Reasoning 10 (1993) 236-237.
37. M.H. Williams, Q. Kong, Incomplete information in a deductive database, Data and Knowledge Engineering 3 (3) (1988) 197-220.
38. A. Yahya, A Goal-Driven approach to efficient query processing in disjunctive theories, Abstract: Dagstuhl Seminar On Disjunctive Logic Programming and Databases:Non-monotonic Aspects: Report number 9627 Full Version :Technical Report PMS-FB-1996-12, Department of Computer Science, University of Munich, Munich, Germany, July 1996. WWW: http:// www.informatik.uni-muenchen.de/pms/publikationen/berichte/PMS-FB-1996-12.ps.gz.
39. A. Yahya, Generalized Query answering in disjunctive databases using minimal model generation, Technical Report PMS-FB-96-13, Munich University, Munich, Germany, 1996, WWW: http://www.informatik.uni-muenchen.de/pms/publikationen/berichte/ PMS-FB-1996-13.ps.gz.
40. A. Yahya, Generalized query answering in disjunctive deductive databases: procedural and nonmonotonic aspects, in: Proceedings of the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning, LNCS, Lecture Notes in Computer Science, vol. 1265, Springer, Berlin, 1997, pp. 278-294 .
41. A. Yahya, Updates in disjunctive databases: a minimal model based approach, in: Proceedings of the International Workshop on Logic Programming and Knowledge Representation LPKR97, October 1997, pp. 25-39.
42. A. Yahya, Model generation in disjunctive normal databases, Technical Report PMS-FB-96-10, Munich University, Munich, Germany, June 1996. WWW: http://www.informatik.uni-muenchen.de/pms/publikationen/berichte/PMS-FB-1996-10. ps.gz.
43. A. Yahya, J.A. Fernandez, J. Minker, Ordered model trees: a normal form for disjunctive deductive databases, Journal of Automated Reasoning 13 (1) (1994) 117-144.
44. A. Yahya, L.J. Henschen, Deduction in non-horn databases, Journal of Automated Reasoning 1 (2) (1985) 141-160.
45. A. Yahya, J. Minker, Representations for disjunctive deductive deatabases, Technical Report CS-TR-3111, UMIACS-TR-93-70, Department of Computer Science and UMIACS, University of Maryland, College Park, July 1993.