Succinctness as a source of complexity in logical formalisms

Annals of Pure and Applied Logic

Volumn 97, Issue 1-3, 1999, Pages 231-260

  Gottlob, Georg ^a   Leone, Nicola ^a   Veith, Helmut ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Descriptive complexity theory; Expression complexity; Quantifier free reductions; Query languages; Second order logic; Succinct problems

Indexed keywords

EID: 0033590739     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(98)00057-8     Document Type: Article

References (53)

1. J. Balcázar, The complexity of searching implicit graphs, 22nd ICALP, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 209-219.
2. J. Balcázar, A. Lozano, J. Toran, The complexity of algorithmic problems on succinct instances, in: R. Baeza-Yates, U. Manber (Eds.), Computer Science, Plenum Press, New York, 1992, pp. 351-377.
3. A. Blass, Y. Gurevich, Henkin quantifiers and complete problems, Ann. Pure Appl. Logic 32 (1986) 1-16.
4. B. Borchert, A. Lozano, Succinct circuit representations and leaf languages are basically the same concept, Inform. Process. Lett. 58 (1996) 211-215.
5. B. Borchert, R. Silvestri, A characterization of the leaf language classes, inform. Process. Lett. 63 (1997) 153-158.
6. M. Cadoli, T. Eiter, G. Gottlob, Using default logic as a query language, IEEE Trans. Knowledge Data Eng. 9(3) (1997) 448-463.
7. A. Chandra, C. Kozen, L. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 (1981) 114-133.
8. K. Compton, C. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Ann. Pure Appl. Logic 48 (1990) 1-79.
9. H. Ebbinghaus, J. Flum, Finite Model Theory, Springer, Berlin, 1995.
10. T. Eiter, G. Gottlob, The complexity of logic-based abduction, J. Assoc. Comput. Mach. 42(1) (1995) 3-42.
11. T. Eiter, G. Gottlob, N. Leone, Abduction from logic programs: Semantics and complexity, Theoretical Computer Science - Logic, Semantics and Theory of Programming, vol. 189, Elsevier, Amsterdam, 1997a, pp. 129-177.
12. T. Eiter, G. Gottlob, H. Mannila, Disjunctive datalog, ACM Trans. Database Systems 22 (1997b) 364-418.
13. T. Eiter, N. Leone, D. Sacca, Expressive power and complexity of partial models for disjunctive deductive databases, Theoretical Computer Science - Logic, Semantics and Theory of Programming, vol. 206, Elsevier, Amsterdam, 1998, pp. 181-218.
14. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, 1974, pp. 43-74.
15. H. Galperin, A. Wigderson, Succinct representation of graphs, Inform. Control 56 (1983) 183-198.
16. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of Np-completeness, Freeman, New York, 1979.
17. G. Gottlob, Complexity results for nonmonotonic logics, J. Logic Comput. 2(3) (1992) 397-425.
18. G. Gottlob, Relativized logspace and generalized quantifiers over finite structures, J. Symbolic Logic 62(2) (1997) 545-574.
19. G. Gottlob, N. Leone, H. Veith, Second order logic and the weak exponential hierarchies, Mathematical Foundations of Computer Science (mFcs), Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 66-81.
20. W. Hanf, Model-theoretic methods in the study of elementary logic, in: J. Addison, L. Henkin, A. Tarski (Eds.), The Theory of Models, North-Holland, Amsterdam, 1965, pp. 132-145.
21. J. Hartmanis, N. Immerman, V. Sewelson, Sparse sets in NP-Pol: EXPTIME versus NEXPTIME, Inform. Control 65 (1985) 159-181.
22. J. Hartmanis, R.E. Stearns, On the computational complexity of algorithms, Trans. Am. Math. Soc. 117 (1965) 285-306.
23. J. Hartmanis, Y. Yesha, Computation times of NP sets of different densities, Theoret. Comp. Sci. 34 (1984) 17-32.
24. L.A. Hemachandra, The strong exponential hierarchy collapses, J. Comput. System Sci. 39 (1989) 299-322.
25. L. Henkin, Some remarks on infinitely long formulas, Symp. on The Foundations of Mathematics, Warsaw, 1959, pp. 167-183.
26. J. Hobbs, M. Stickel, Interpretation as abduction, 26th Annual Meeting of The Assoc. for Computational Linguistics, 1988.
27. N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760-778.
28. N. Immerman, Nondeterministic space is closed under complementation, SIAM J. Comput. 17 (1988) 935-938.
29. D. Johnson, A catalog of complexity classes, in: van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 67-162.
30. A. Kakas, P. Mancarella, Generalized stable models: A semantics for abduction, ECAI, 1989, pp. 385-391.
31. A. Kakas, P. Mancarella, Database updates through abduction, VLDB, 1990, pp. 650-661.
32. P. Kolaitis, C. Papadimitriou, Why not negation by fixpoint? J. Comput. System Sci. 43 (1991) 125-144.
33. M. Krynicki, M. Mostowski, Henkin quantifiers, in: et al., M.K. (Ed.), Quantifiers: Logics, Models and Computation, vol. 1, Kluwer Academic Publishers, Dordrecht, 1995, pp. 193-262.
34. R. Ladner, N. Lynch, Relativizations about questions of logspace computability, J. Comput. System Sci. 10 (1976) 19-32.
35. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
36. C. Papadimitriou, M. Yannakakis, A note on succinct representations of graphs, Inform. Control 71 (1985) 181-185.
37. C. Peirce, Abduction and induction, in: J. Buchler (Ed.), Philosophical Writings of Peirce, Ch. 11, Dover, New York, 1955.
38. D. Poole, Normality and faults in logic based diagnosis, IJCAI, 1989, pp. 1304-1310.
39. R. Reiter, A logic for default reasoning, Artif. Intell. 13 (1980) 81-132.
40. A. Selman, 1st. Structure in complexity theory conference, Lecture Notes in Computer Science, vol. 223, Springer, Berlin, 1986.
41. G. Sher, The Bounds of Logic, MIT Press, Cambridge, 1991.
42. I. Stewart, Complete problems involving boolean labelled structures and projection transactions, J. Logic Comput. 1 (1991) 861-882.
43. I. Stewart, Logical characterization of bounded query classes I: Logspace oracle machines, Fund. Inform. 18 (1993a) 65-92.
44. I. Stewart, Logical characterization of bounded query classes II: Logspace oracle machines, Fund. Inform. 18 (1993) 93-105.
45. I. Stewart, On completeness for NP via projection translations, Lecture Notes in Comput. Sci., vol. 626, Springer, Berlin, 1993. pp. 353-366.
46. L.J. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.
47. R. Szelepcsényi, The method of forced enumeration for nondeterministic automata, Acta Inform. 26 (1988) 279-284.
48. J. Väänänen, Remarks on generalized quantifiers and second order logics, Prace Naukowe Inst. Mat. Politech. Wroclawski Ser. Kon. (1977).
49. M. Vardi, Complexity of relational query languages, 14th Symp. on Theory of Computing (sToc), 1982, pp. 137-146.
50. H. Veith, How to encode a logical structure as a string, Technical Report DBAI-TR-97-10, Institute of Information Systems, TU Vienna, 1997.
51. H. Veith, Languages represented by boolean formulas, Inform. Process. Lett. 63 (1997) 251-256.
52. H. Veith, Succinct representation, leaf languages and projection reductions, Inform. Comput. 142 (1998) 207-236.
53. K. Wagner, The complexity of combinatorial problems with succinct input representation, Acta Inform. 23 (1986) 325-356.