On the semantics and expressive power of datalog-like languages for NP search and optimization problems

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2004, Pages 692-697

  Zumpano, E ^a   Greco, S ^a   Trubitsyna, I ^a   Veltri, P ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY MAGNA GRAECIA OF CATANZARO   (Italy)

Author keywords

Datalog; Deductive and Logic databases; Expressive Power of Query Languages; Search and Optimization Queries

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; CONSTRAINT THEORY; DATABASE SYSTEMS; LOGIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SEMANTICS; SET THEORY;

DATALOG; DEDUCTIVE AND LOGIC DATABASES; EXPRESSIVE POWER OF QUERY LANGUAGES; SEARCH AND OPTIMIZATION QUERIES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 2442562538     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.968045     Document Type: Conference Paper

References (23)

1. Abiteboul, S., Hull, R., and Vianu, V., Foundations of Databases, Addison-Wesley, 1994.
2. Apt, K., Blair, H., and Walker, A., Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kauffman, 1988.
3. Ausiello, G., Crescenzi, P., and Protasi M., Approximate solution of NP optimization problems. TCS, No. 150, 1-55, 1995.
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M., Complexity and Approximation - Combinatorial optimization problems and their approximability properties Springer-Verlag, 1999.
5. Fagin, R., Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In Complexity of Computation (R. Karp, Ed.), SIAM-AMS Proc., Vol. 7, 43-73, 1974.
6. Fenner, S., Green, F., Homer, S., Selman, A. L., Thierauf, T. and Vollmer H., Complements of Multivalued Functions. Chicago Journal of Theoretical Computer Science, 1999.
7. Gelfond, M., and Lifschitz, V., The Stable Model Semantics for Logic Programming. Proc. 5th Int. Conf. on Logic Programming, 1070-1080, 1988.
8. Greco, S., Saccà, D., and Zaniolo C., Extending stratified datalog to capture complexity classes ranging from P to QH. Acta Informatica, 37(10), 699-725, 2001.
9. Greco, S., and Saccà, D., NP-Optimization Problems in Datalog. Proc. Int. Logic Programming Symp., 181-195, 1997.
10. Johnson, D. S., A Catalog of Complexity Classes, In Handbook of Theoretical Computer Science, Vol. 1, J. van Leewen (ed.), North-Holland, 1990.
11. Kolaitis, P. G., and Papadimitriou, C. H., Why not Negation by Fixpoint? JCSS, 43(1), 125-144, 1991.
12. Kolaitis, P. G., and Thakur, M. N., Logical Definability of NP Optimization Problems. Information and Computation, No. 115.
13. Kolaitis, P. G., and Thakur, M. N., Approximation Properties of NP Minimization Classes. J. of Computer and System Sc., No. 51, 391-411, 1995.
14. Leggett, E., and Moore, J., Optimization problems and the polynomial hierarchy. Theoretical Computer Science, No. 15, 279-289, 1981.
15. Lloyd, J., Foundations of Logic Programming. Springer-Verlag, 1987.
16. Marek, W., and Truszczynski, M., Autoepistemic Logic. J. ACM, Vol. 38, No. 3, 588-619, 1991.
17. Panconesi, A., and Ranjan, D., Quantifiers and Approximation. TCS, No. 1107, 145-163, 1992.
18. Papadimitriou, C. H., and Steiglitz, K., Combinatorial Optimization - Algorithms and Complexity. Prentice-Hall, 1982.
19. Papadimitriou, C. H., and Yannakakis, M., Optimization, Approximation, and Complexity Classes. JCSS, No. 43, 425-440, 1991.
20. Papadimitriou, C. H., Computational Complexity. Addison-Wesley, 1994.
21. Saccà, D., The Expressive Powers of Stable Models for Bound and Unbound Queries. Journal of Computer and System Sciences, 54(3), 441-464, 1997.
22. Selman, A., A taxonomy of complexity classes of functions. Journal of Computer and System Science, No. 48, 357-381, 1994.
23. Ullman, J. K., Principles of Data and Knowledge-Base Systems, volume 1 and 2. Computer Science Press, New York, 1988.