"Possible is certain" is desirable and can be expressive

Annals of Mathematics and Artificial Intelligence

Volumn 19, Issue 1-2, 1997, Pages 147-168

  Greco, Sergio ^a   Saccà, Domenico ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031479814     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018903705269     Document Type: Article

References (35)

1. S. Abiteboul and V. Vianu, DATALOG extensions for databases queries and updates, Journal of Computer and System Science 43 (1991) 62-124.
2. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, 1994).
3. S. Abiteboul, E. Simon and V. Vianu, Non-deterministic languages to express deterministic transformations, in: Proc. ACM PODS Symp. (1990) pp. 218-229.
4. C. Baral and V Subrahmanian, Stable and extension class theory for logic programs and default logic, Journal of Automated Reasoning (1992) 345-366.
5. A. Chandra and D. Harel, Structure and complexity of relational queries, Journal of Computer and System Sciences 25(1) (1982) 99-128.
6. P. Dung, Negation as hypotheses: an abductive foundation for logic programming, in: Proc. 8th Conf. on Logic Programming (1991) pp. 3-17.
7. T. Eiter, G. Gottlob and H. Mannila, Expressive power and complexity of disjunctive DATALOG, in: Proc. ACM PODS Symp., Minneapolis, USA (May 1994).
8. T. Eiter, N. Leone and D. Saccà, The expressive power of partial models for disjunctive deductive databases, in: Proc. Workshop on Logic in Databases (LID '96), San Miniato (July, 1996).
9. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: Complexity of Computation, ed. R. Karp, SIAM-AMS Proc., Vol. 7 (1974) pp. 43-73.
10. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proc. 5th Int. Conf. and Symp. on Logic Programming, MIT Press, Cambridge (1988) pp. 1070-1080.
11. F. Giannotti, S. Greco, D. Saccà and C. Zaniolo, Programming with non-determinism in deductive databases, Ann. of Math, and AI (this issue).
12. F. Giannotti, D. Pedreschi, D. Saccà and C. Zaniolo, Non-determinism in deductive databases, in: Proc. 2nd Conf. on Deductive and Object-Oriented Databases (1991) pp. 129-146.
13. P, in: Proc. of the Fifth Int. Conf. on Database Theory (1995) pp. 82-96.
14. S. Greco and D. Saccà, A query language that captures the query hierarchy, unpublished manuscript (1995).
15. S. Grumbach, Z. Lacroix and S. Lindell, Implicit definitions on finite structures, in: Proc. of the Conf. on Computer Science Logic (1995).
16. Y. Gurevich, Logic and the challenge of computer science, in: Trends in Theoretical Computer Science, ed. E. Borger (Computer Science Press, 1988).
17. N. Immerman, Languages which capture complexity classes, SIAM Journal on Computing 16(4) (1987) 760-778.
18. D.S. Johnson, A catalog of complexity classes, in: Handbook of Theoretical Computer Science, Vol. 1 (North-Holland, 1990).
19. P.C. Kanellakis, Elements of relational database theory, in: Handbook of Theoretical Computer Science, Vol. 2 (North-Holland, 1991).
20. P.G. Kolaitis and C.H. Papadimitriou, Why not negation by fixpoint?, Journal of Computer and System Sciences 43 (1991) 125-144.
21. R. Krishnamurthy and S.A. Naqvi, Non-deterministic choice in DATALOG, in: Proc. 3rd Int. Conf. on Data and Knowledge Bases (Morgan-Kaufmann, Los Altos, 1988) pp. 416-424.
22. J.W. Lloyd, Foundations of Logic Programming (Springer-Verlag, Berlin, 1987).
23. W. Marek and M. Truszcynski, Autoepistemic logic, J. of the ACM 38(3) (1991) 588-619.
24. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, 1994).
25. T.C. Przymusinski, Well-founded semantics coincides with three-valued stable semantics, Foundamenta Informaticae 13 (1990) 445-463.
26. D. Saccà, The expressive powers of stable models for bound and unbound DATALOG queries, Journal of Computer and System Science (to appear).
27. D. Saccà, Multiple total stable models are definitely needed to solve unique solution programs, Information Processing Letters 58(5) (1996) 249-254.
28. D. Saccà and C. Zaniolo, Stable models and non-determinism in logic programs with negation, in: Proc. ACM PODS Symp. (1990) pp. 205-218.
29. D. Saccà and C. Zaniolo, Deterministic and non-deterministic stable models, submitted to Journal of Logic and Computation.
30. J.S. Schlipf, The expressive powers of the logic programming semantics, Journal of Computer and System Science 51 (1995) 64-86.
31. J.D. Ullman, Principles of Database and Knowledge Base Systems, Vols. 1-2 (Computer Science Press, 1989).
32. M.Y. Vardi, The complexity of relational query languages, in: Proc. ACM Symp. on Theory of Computing (1982) pp. 137-146.
33. A. Van Gelder, K. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38(3) (1991) 620-650.
34. A. Van Gelder, The alternating fixpoint of logic programming with negation, Journal of Computer and System Sciences 43 (1992) 125-144.
35. J. You and L.Y. Yuan, On the equivalence of semantics for normal logic programs, Journal of Logic Programming (1995) 211-222.