On the indiscernibility of individuals in logic programming

Journal of Logic and Computation

Volumn 7, Issue 6, 1997, Pages 805-824

  Eiter, Thomas ^a   Gottlob, Georg ^b   Leone, Nicola ^b  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345507039     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/7.6.805     Document Type: Article

References (54)

1. A. Abiteboul, K. Compton and V. Vianu. Queries are easier than you thought (probably). In Proceedings of ACM PODS '92, pp. 218-229. ACM Press, 1992.
2. S. Abiteboul and A. van Gelder. Optimizing active databases using the split technique. In Proceedings of the 4th International Conference on Database Theory (ICDT '92), J. Biskup and R. Hull, eds. Vol. 646 of Lecture Notes in Computer Science, pp. 171-187, Springer Verlag, Berlin, 1992.
3. K. Apt, H. Blair and A. Walker. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, ed. pp. 89-148. Morgan Kaufmann, Washington, 1988.
4. K. Apt and N. Bol. Logic programming and negation: a survey. Journal of Logic Programming, 19/20, 9-71, 1994.
5. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19/20, 73-148, 1994.
6. C. Baral and V. Subrahmanian. Stable and extension class theory for logic programs and default logic. Journal of Automated Reasoning, 8, 345-366, 1992.
7. R. Ben-Eliyahu and R. Dechter. Prepositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12, 53-87, 1994.
8. R. Ben Eliyahu, N. Francez and M. Kaminski. Similarity preservation in default logic. Technical Report 96-04, Department of Mathematics and Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel, 1996.
9. S. Brass and J. Dix. Characterizations of the stable semantics by partial evaluation. Journal of Logic Programming, 32, 1997, in press.
10. S. Brass and J. Dix. Disjunctive semantics based upon partial and bottom-up evaluation. In Proceedings of the 12th International Conference on Logic Programming, Tokyo, June 1995, L. Sterling, ed. pp. 199-213. The MIT Press, Cambridge, MA, 1995.
11. F. Buccafurri, N. Leone and P. Rullo. Stable models and their computation for logic programming with inheritance and true negation. Journal of Logic Programming, 27, 5-43, 1996.
12. J. Dix. Semantics of logic programs: their intuitions and formal properties. An overview. In Logic, Action and Information. Proceedings of the Konstanz Colloquium in Logic and Information (LogIn'92), A. Fuhrmann and H. Rott, eds. pp. 241-329. DeGruyter, 1995.
13. T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: prepositional case. Annals of Mathematics and Artificial Intelligence, 15, 289-323, 1995.
14. T. Eiter, G. Gottlob and N. Leone. Abduction from logic programs: semantics and complexity. Theoretical Computer Science, in press. Extended abstract in Proceedings LPNMR'95, Vol. 982 of Lecture Notes in Computer Science, pp. 1-14, Springer Verlag, Berlin, 1995.
15. T. Eiter, G. Gottlob and H. Mannila. Disjunctive datalog. In ACM Transactions on Database Systems, 22, 1997. Extended abstract Proceedings of ACM PODS '94, pp. 267-278. ACM Press, 1994.
16. T. Eiter, G. Gottlob and H. Mannila. Disjunctive datalog. In ACM Transactions on Database Systems, 22, 1997. Extended abstract Proceedings of ACM PODS '94, pp. 267-278. ACM Press, 1994.
17. T. Eiter, N. Leone and D. Saccà. On the partial semantics for disjunctive deductive databases. Annals of Mathematics and Artificial Intelligence, 17, 59-96, 1997.
18. T. Eiter, N. Leone and D. Saccà. Expressive power of partial models for disjunctive deductive databases. Theoretical Computer Science, in press. Extended abstract in Proceedings International Workshop on Logic in Databases (LID '96), D. Pedreschi and C. Zaniolo, eds. Vol. 1154 of Lecture Notes in Computer Science, pp. 245-264. Springer Verlag, Berlin, 1996.
19. T. Eiter, N. Leone and D. Saccà. Expressive power of partial models for disjunctive deductive databases. Theoretical Computer Science, in press. Extended abstract in Proceedings International Workshop on Logic in Databases (LID '96), D. Pedreschi and C. Zaniolo, eds. Vol. 1154 of Lecture Notes in Computer Science, pp. 245-264. Springer Verlag, Berlin, 1996.
20. M. Gelfond. Logic programming and reasoning with incomplete information. Annals of Mathematics and Artificial Intelligence, 12, 89-116, 1994.
21. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Logic Programming: Proceedings of the Fifth International Conference and Symposium, R. A. Kowalski and K. A. Bowen, eds. pp. 1070-1080. The MIT Press, Cambridge, MA, 1988.
22. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9, 365-385, 1991.
23. G. Gottlob, N. Leone and H. Veith. Second-order logic and the weak exponential hierarchies. In Proceedings of the 20th Conference on Mathematical Foundations of Computer Science (MFCS '95), Prague, J. Wiedermann and P. Hajek, eds. Vol. 969 of Lecture Notes in Computer Science, pp. 66-81. Springer Verlag, Berlin, 1995. Full paper CD/TR 95/80, Christian Doppler Lab for Expert Systems, TU Vienna.
24. L. Hemachandra. The strong exponential hierarchy collapses. Journal of Computer and System Sciences, 39, 299-322, 1989.
25. A. Kakas, R. Kowalski and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2, 719-770, 1992.
26. R. Kowalski and F. Sadri. Logic programs with exceptions. In Proceedings of ICLP-90, D. H. D. Warren and P. Szeredi, eds. pp. 598-616. The MIT Press, Cambridge, MA, 1990.
27. E. Laenens, D. Saccá and D. Vermeir. Extending logic programming. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 184-213. ACM Press, 1990.
28. E. Laenens and D. Vermeir. A fixpoint semantics for ordered logic. Journal of Logic Programming, 1, 159-185, 1990.
29. N. Leone, P. Rullo and F. Scarcello. Disjunctive stable models: unfounded sets, fixpoint semantics, and computation. Information and Computation, 1997, in press. Extended abstract in Proceedings of International Logic Programming Symposium-ILPS'95, pp. 399-413, The MIT Press, Cambridge, MA, 1995.
30. N. Leone, P. Rullo and F. Scarcello. Disjunctive stable models: unfounded sets, fixpoint semantics, and computation. Information and Computation, 1997, in press. Extended abstract in Proceedings of International Logic Programming Symposium-ILPS'95, pp. 399-413, The MIT Press, Cambridge, MA, 1995.
31. V. Lifschitz and H. Turner. Splitting a logic program. In Proceedings of ICLP-94, Santa Margherita Ligure, Italy, pp. 23-38. The MIT Press, Cambridge, MA, 1994.
32. J. Lobo, J. Minker and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, MA, 1992.
33. W. Marek, A. Nerode and J. Remmel. The stable models of a predicate logic program. Journal of Logic Programming, 21, 129-153, 1994.
34. W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38, 588-619, 1991.
35. W. Marek and M. Truszczyński. Computing intersection of autoepistemic expansions. In Proceedings of LPNMR-91, Washington, DC, A. Nerode, W. Marek and V. Subrahmanian, eds. pp. 37-50, The MIT Press, Cambridge, MA, 1991.
36. J. Minker. On indefinite data bases and the closed world assumption. In Proceedings of the 6th Conference on Automated Deduction (CADE '82), D. Loveland, ed. Vol. 138 of Lecture Notes in Computer Science, pp. 292-308, Springer Verlag, New York, 1982.
37. J. Minker, ed. Foundations of Deductive Databases and Logic Programming. Morgan Kaufman, Washington, DC, 1988.
38. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
39. T. Przymusinski. On the declarative and procedural semantics of stratified deductive databases. In Foundations of Deductive Databases and Logic Programming. J. Minker, ed. pp. 193-216. Morgan Kaufman, Washington, DC, 1988.
40. T. Przymusinski. Well-founded semantics coincides with 3-valued semantics. Fundamenta Informaticae, 13, 445-463, 1990.
41. T. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9, 401-424, 1991.
42. T. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 14, 323-357, 1995.
43. K. Ross. The well-founded semantics for disjunctive logic programs. In Proceedings of the First International Conference on Deductive and Object-Oriented Databases (DOOD-89), W. Kim, J.-M. Nicholas and S. Nishio, eds. pp. 352-369, Elsevier Science BV, North Holland, 1990.
44. C. Sakama. Possible model semantics for disjunctive databases. In Proceedings of the First International Conference on Deductive and Object-Oriented Databases (DOOD-89), pp. 337-351, 1990.
45. D. Saccà. The expressive powers of stable models for bound and unbound DATALOG queries. Journal of Computer and System Sciences, 54, 1997, in press.
46. D. Saccà and C. Zaniolo. Deterministic and non-deterministic stable models. Journal of Logic and Computation, 7, 555-581, 1997.
47. J. Schlipf. The expressive powers of logic programming semantics. Journal of Computer and System Sciences, 51, 64-86, 1995. Abstract in Proceedings of the ACM PODS '90, pp. 196-204. ACM Press, 1990.
48. J. Schlipf. The expressive powers of logic programming semantics. Journal of Computer and System Sciences, 51, 64-86, 1995. Abstract in Proceedings of the ACM PODS '90, pp. 196-204. ACM Press, 1990.
49. L. Stockmeyer. Classifying the computational complexity of problems. Journal of Symbolic Logic, 52, 1-43, 1987.
50. M. H. van Emden and R. Kowalski. The semantics of logic as a programming language. Journal of the ACM, 3, 733-742, 1976.
51. A. van Gelder, K. Ross and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38, 620-650, 1991.
52. M. Vardi. Complexity of relational query languages. In Proceedings of the 14th ACM STOC, San Francisco, pp. 137-146. ACM Press, 1982.
53. J.-H. You and L. Yuan. A three-valued semantics for deductive databases and logic programs. Journal of Computer and System Sciences, 49, 334-361, 1994.
54. J.-H. You and L. Yuan. On the equivalence of semantics for normal logic programming. Journal of Logic Programming, 22, 211-222, 1995.