Declarative PTIME queries for relational databases using quantifier elimination

Journal of Logic and Computation

Volumn 9, Issue 5, 1999, Pages 737-758

  Doherty, Patrick ^a   Łukaszewicz, Witold ^b   Szałas, Andrzej ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL OPERATORS; POLYNOMIALS; RELATIONAL DATABASE SYSTEMS;

DECLARATIVE QUERIES; DEDUCTIVE DATABASES; QUANTIFIER ELIMINATION; SEMI-HORN QUERY LANGUAGE (SHQL);

QUERY LANGUAGES;

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

References (15)

1. S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. W. Ackermann. Untersuchungen über das eliminationsproblem der mathematischen logik. Mathematische Annalen, 110, 390-413, 1935.
3. A. K. Chandra. Theory of database queries. In Proceedings of the 7th ACM Symposium on Principles of Database Systems, pp. 1-9, 1988.
4. P. Doherty, W. Łukaszewicz and A. Szałas. General domain circumscription and its first-order reduction. In Proceedings of the 1st International Conference on Formal and Applied Practical Reasoning (FAPR-96), volume 1085 of LNAI, D. Gabbay and H. J. Ohlbach, eds. pp. 93-109. Springer-Verlag, Berlin, 1996.
5. P. Doherty, W. Łukaszewicz and A. Szałas. A reduction result for circumscribed semi-horn formulas. Fundamenta Informaticae, 28, 261-272, 1996.
6. P. Doherty, W. Łukaszewicz and A. Szałas. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning, 18, 297-336, 1997.
7. P. Doherty, W. Łukaszewicz and A. Szałas. General domain circumscription and its effective reductions. Fundamenta Informaticae, 34, 1-33, 1998.
8. Y. Gurevich and S. Shelah. Fixpoint extensions of first-order logic. Annals of Pure and Applied Logic, 32, 265-280, 1986.
9. N. Immerman. Descriptive and computational complexity. In Proceedings of Symposia in Applied Mathematics, Volume 38, pp. 75-91, 1989.
10. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68, 86-104, 1989.
11. A. Nonnengart and A. Szałas. A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, E. Orlowska, ed. pp. 89-108. Physica Verlag, 1998. Also in: Report of Max-Planck-Institut für Informatik, MPI-I-95-2-007, Saarbrücken, Germany.
12. R. Reiter. On closed world databases. In Logic and Databases, H. Gallaire and J. Minker, eds. pp. 55-76. Plenum Press, New York, 1978.
13. V. Sazonov. A logical approach to the problem of P=NP. Volume 88 of Lecture Notes in Computer Science, pp. 562-572. Springer-Verlag, Berlin, 1980.
14. A. Szałas. On the correspondence between modal and classical logic: An automated approach. Journal of Logic and Computation, 3, 605-620, 1993.
15. M. Y. Vardi. The complexity of relational query languages. In 14th ACM Symposium on the Theory of Computing, pp. 137-146, 1982.