메뉴 건너뛰기




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

Polynomial-Time Computation via Local Inference Relations

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
Times cited : (22)

References (23)
  • 1
    • 85024264461 scopus 로고    scopus 로고
    • Automated complexity analysis based on ordered resolution
    • IEEE Computer Society Press, Los Alamitos, Calif. BASIN, D. and GANZINGER, H. 2001. Automated complexity analysis based on ordered resolution. JACM
    • 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
    • (1996) Proceedings of the 11th IEEE Symposium on Logic in Computer Science , vol.48 , Issue.1 , pp. 70-109
    • Basin, D.1    Ganzinger, H.2
  • 2
    • 0008202942 scopus 로고
    • Query evaluation in recursive databases: Bottom-up and top-down reconciled
    • Bry, F. 1990. Query evaluation in recursive databases: Bottom-up and top-down reconciled. Data Knowl. Eng. 5, 289-312
    • (1990) Data Knowl. Eng. , vol.5 , pp. 289-312
    • Bry, F.1
  • 3
    • 77956759664 scopus 로고
    • Natural language based inference procedures applied to Schubert's steamroller
    • Morgan-Kaufmann, Reading, Mass.
    • 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
    • (1991) Proceedings of AAAI-91 , pp. 915-920
    • Givan, R.1    Mcallester, D.2    Shalaby, S.3
  • 4
    • 0031576314 scopus 로고    scopus 로고
    • How to define a linear order on finite models
    • 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
    • (1997) Ann. PureAppl. Logic , vol.87 , pp. 241-267
    • Hella, L.1    Kolaitis, P.G.2    Luosto, K.3
  • 5
    • 0022500426 scopus 로고
    • Relational queries computable in polynomial time
    • Immerman, N. 1986. Relational queries computable in polynomial time. Inf. Contr. 68, 86-104
    • (1986) Inf. Contr. , vol.68 , pp. 86-104
    • Immerman, N.1
  • 6
    • 0004226070 scopus 로고    scopus 로고
    • Descriptive Complexity
    • Springer-Verlag, New York
    • Immerman, N. 1999. Descriptive Complexity. Springer-Verlag, New York
    • (1999)
    • Immerman, N.1
  • 9
    • 84966254647 scopus 로고
    • Estimating the efficiency of backtrack programs
    • (Jan.)
    • Knuth, D. E. 1975. Estimating the efficiency of backtrack programs. Math. Comput. 29, (Jan.), 129, 121-136
    • (1975) Math. Comput. 29 , vol.129 , pp. 121-136
    • Knuth, D.E.1
  • 11
    • 0016923775 scopus 로고
    • Consistency in networks of relations
    • Mackworth, A. K. 1977. Consistency in networks of relations. Artif. Int. 8, 1, 99-181
    • (1977) Artif. Int. , vol.8 , Issue.1 , pp. 99-181
    • Mackworth, A.K.1
  • 12
    • 0345595103 scopus 로고
    • Ontic: AKnowledge Representation System for Mathematics
    • MIT Press
    • Mcallester, D. A. 1989. Ontic: AKnowledge Representation System for Mathematics. MIT Press
    • (1989)
    • Mcallester, D.A.1
  • 13
    • 0027578148 scopus 로고
    • Automatic recognition of tractability in inference relations
    • (Apr.)
    • Mcallester, D. 1993. Automatic recognition of tractability in inference relations. JACM 40, 2 (Apr.), 284-303
    • (1993) JACM , vol.40 , pp. 284-303
    • Mcallester, D.1
  • 15
    • 0003089416 scopus 로고
    • Bottom-up evaluation of logic programs
    • J. L. Lassez and G. Plotkin, eds, MIT Press, Cambridge, Mass
    • 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
    • (1991) Computational Logic
    • Naughton, J.1    Ramakrishnan, R.2
  • 18
    • 0017995402 scopus 로고
    • An algorithm for reasoning about equality
    • (July)
    • Shostak, R. 1978. An algorithm for reasoning about equality. Comm. ACM., 21, 2 (July), 583-585
    • (1978) Comm. ACM. , vol.21 , Issue.2 , pp. 583-585
    • Shostak, R.1
  • 20
    • 85040876697 scopus 로고
    • Principles of Database and Knowledge-Base Systems
    • Computer Science Press
    • Ullman, J. 1988. Principles of Database and Knowledge-Base Systems. Computer Science Press
    • (1988)
    • Ullman, J.1
  • 22
    • 0003683967 scopus 로고
    • Constraint Satisfaction in Logic Programming
    • MIT Press, Cambridge, Mass
    • Van Hentenryck, P. 1989. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, Mass
    • (1989)
    • Van Hentenryck, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.