메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 1489, Issue , 1998, Pages 355-368
Propositional lower bounds: Generalization and algorithms
Author keywords

[No Author keywords available]
Indexed keywords

KNOWLEDGE BASED SYSTEMS; POLYNOMIAL APPROXIMATION;
EID: 0041407856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49545-2_24     Document Type: Conference Paper
Times cited : (1)
References (10)
  • 1
    • 0001804231 scopus 로고
    • Semantical and computational aspects of Horn approximations
    • M. Cadoli, Semantical and computational aspects of Horn approximations. In Pmc.of IJCAI-93, pages 39-44, 1993.
    • (1993) Pmc.Of IJCAI-93 , pp. 39-44
    • Cadoli, M.1
  • 2
    • 0000949717 scopus 로고
    • A class of logic problems solvable by linear programming
    • M. Conforti and G. Cornuejols. A class of logic problems solvable by linear programming. J. of the ACM, 42:1107-1113, 1995.
    • (1995) J. Of the ACM , vol.42 , pp. 1107-1113
    • Conforti, M.1    Cornuejols, G.2
  • 3
    • 0021509216 scopus 로고
    • Linear-time algorithms for testing the satisfiability of propositional Horn formulae
    • W. P. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. of Logic Programming, 1:267-284, 1984.
    • (1984) J. Of Logic Programming , vol.1 , pp. 267-284
    • Dowling, W.P.1    Gallier, J.H.2
  • 4
    • 0002833904 scopus 로고
    • An analysis of approximate knowledge compilation
    • A. del Val. An analysis of approximate knowledge compilation. In Proc. of IJCAI-95, pages 830-836, 1995.
    • (1995) Proc. Of IJCAI-95 , pp. 830-836
    • Delval, A.1
  • 5
    • 0001951331 scopus 로고
    • A catalog of complexity classes
    • Chapter 2, J. van Leeuwen ed., Elsevier Sc. Pub
    • D.S. Johnson, A catalog of complexity classes. In Handbook of theoretical computer science, Chapter 2, pages 67-161, J. van Leeuwen ed., Elsevier Sc. Pub., 1990.
    • (1990) Handbook of Theoretical Computer Science , pp. 67-161
    • Johnson, D.S.1
  • 6
    • 0027002153 scopus 로고
    • Forming concepts for fast inference
    • H. A. Kautz and B. Selman. Forming concepts for fast inference. In Proc. of AAAI-92, pages 786-793, 1992.
    • (1992) Proc. Of AAAI-92 , pp. 786-793
    • Kautz, H.A.1    Selman, B.2
  • 7
    • 0028566768 scopus 로고
    • An empirical evaluation of knowledge compilation by theory approximation
    • H. A. Kautz and B. Selman. An empirical evaluation of knowledge compilation by theory approximation. In Proc. of AAAI-94, pages 155-161, 1994.
    • (1994) Proc. Of AAAI-94 , pp. 155-161
    • Kautz, H.A.1    Selman, B.2
  • 8
    • 0030365398 scopus 로고    scopus 로고
    • Compilation for critically constrained knowledge bases
    • R. Schrag. Compilation for critically constrained knowledge bases. In Proc. of AAAI-96, pages 510-515, 1996.
    • (1996) Proc. Of AAAI-96 , pp. 510-515
    • Schrag, R.1
  • 9
    • 85026919405 scopus 로고
    • Knowledge compilation using Horn approximations
    • B. Selman and H. A. Kautz. Knowledge compilation using Horn approximations. In Proc. of AAAI-91, pages 904-909, 1991.
    • (1991) Proc. Of AAAI-91 , pp. 904-909
    • Selman, B.1    Kautz, H.A.2
  • 10
    • 0030102186 scopus 로고    scopus 로고
    • Knowledge compilation and theory approximation
    • B. Selman and H. A. Kautz. Knowledge compilation and theory approximation. J. of the ACM, 43:193-224, 1996.
    • (1996) J. Of the ACM , vol.43 , pp. 193-224
    • Selman, B.1    Kautz, H.A.2

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