Polynomial-Time Computation via Local Inference Relations

ACM Transactions on Computational Logic

Volumn 3, Issue 4, 2002, Pages 521-541

  Givan, Robert ^a   McAllester, David ^b  

^a PURDUE UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Automated reasoning; complexity theory; decision procedures; Languages; lgorithms; Theory

Indexed keywords

EID: 84881456410     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/566385.566387     Document Type: Article

References (23)

1. Basin, D. and Ganzinger, H. 1996. Automated complexity analysis based on ordered resolution. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif. BASIN, D. and GANZINGER, H. 2001. Automated complexity analysis based on ordered resolution. JACM 48, 1, 70-109
2. Bry, F. 1990. Query evaluation in recursive databases: Bottom-up and top-down reconciled. Data Knowl. Eng. 5, 289-312
3. Givan, R., Mcallester, D., and Shalaby, S. 1991. Natural language based inference procedures applied to Schubert's steamroller. In Proceedings of AAAI-91. Morgan-Kaufmann, Reading, Mass., pp. 915-920
4. Hella, L., Kolaitis, P. G., and Luosto, K. 1997. How to define a linear order on finite models. In Ann. PureAppl. Logic, 87, 241-267
5. Immerman, N. 1986. Relational queries computable in polynomial time. Inf. Contr. 68, 86-104
6. Immerman, N. 1999. Descriptive Complexity. Springer-Verlag, New York
7. Jaffar, J. and Lassez, J. L. 1987. Constraint logic programming. In Proceedings of the 1987 ACM Conference on Principles of Programming Languages. ACM, New York, pp. 111-119
8. Jouvelot, P. and Gifford, D. 1991. Algebraic reconstruction of types and effects. In Proceedings of the 1991 ACM Conference on Principles of Programming Languages. ACM, New York
9. Knuth, D. E. 1975. Estimating the efficiency of backtrack programs. Math. Comput. 29, (Jan.), 129, 121-136
10. Kozen, D. C. 1977. Complexity of finitely presented algebras. In Proceedings of the 9th Annual ACM Symposium on the Theory of Computation. ACM, New York, pp. 164-177
11. Mackworth, A. K. 1977. Consistency in networks of relations. Artif. Int. 8, 1, 99-181
12. Mcallester, D. A. 1989. Ontic: AKnowledge Representation System for Mathematics. MIT Press
13. Mcallester, D. 1993. Automatic recognition of tractability in inference relations. JACM 40, 2 (Apr.), 284-303
14. Mcallester, D. A. and Siskind, J. M. 1991. Lifting transformations. MIT Artificial Intelligence Laboratory Memo 1343, 1991
15. Naughton, J. and Ramakrishnan, R. 1991. Bottom-up evaluation of logic programs. In Computational Logic. J. L. Lassez and G. Plotkin, eds, MIT Press, Cambridge, Mass
16. Papadimitriou, C. H. 1985. A note on the expressive power of Prolog. EATCS Bull. 26, 21-23
17. Pearl, J. and Korf, R. 1987. Search techniques. Ann. Rev. Comput. Sci. 2, 451-467
18. Shostak, R. 1978. An algorithm for reasoning about equality. Comm. ACM., 21, 2 (July), 583-585
19. Talpin, J.-P. and Jouvelot, P. 1992. Type and effect systems. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 162-173
20. Ullman, J. 1988. Principles of Database and Knowledge-Base Systems. Computer Science Press
21. Ullman, J. 1989. Bottom-up beats top-down for datalog. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems. ACM, New York, pp. 140-149
22. Van Hentenryck, P. 1989. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, Mass
23. Vardi, M. 1982. The complexity of relational query languages. In Proceedings of the 14th Symposium on Theory of Computation. pp. 137-146