메뉴 건너뛰기




Volumn 3, Issue , 2008, Pages 1495-1498

Incremental algorithms for approximate compilation

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; FUNCTIONS; INFERENCE ENGINES; PROBABILITY DENSITY FUNCTION; QUERY LANGUAGES;

EID: 57749084336     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (13)
  • 1
    • 0030246260 scopus 로고    scopus 로고
    • Improving the variable ordering of OBDDs is NP-complete
    • Bollig, B., and Wegener, I. 1996. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers 45(9):993-1002.
    • (1996) IEEE Transactions on Computers , vol.45 , Issue.9 , pp. 993-1002
    • Bollig, B.1    Wegener, I.2
  • 6
    • 0000555770 scopus 로고    scopus 로고
    • Model-Based Diagnosis using Structured System Descriptions
    • Darwiche, A. 1998. Model-Based Diagnosis using Structured System Descriptions. Journal of Artificial Intelligence Research 8:165-222.
    • (1998) Journal of Artificial Intelligence Research , vol.8 , pp. 165-222
    • Darwiche, A.1
  • 7
    • 2942697066 scopus 로고    scopus 로고
    • Decomposable negation normal form
    • Darwiche, A. 2001. Decomposable negation normal form. Journal of the ACM (JACM) 48(4):608-647.
    • (2001) Journal of the ACM (JACM) , vol.48 , Issue.4 , pp. 608-647
    • Darwiche, A.1
  • 8
    • 0022680851 scopus 로고
    • An assumption-based TMS
    • de Kleer, J. 1986. An assumption-based TMS. Artif Intell. 28(2): 127-162.
    • (1986) Artif Intell , vol.28 , Issue.2 , pp. 127-162
    • de Kleer, J.1
  • 9
    • 0029236521 scopus 로고
    • The complexity of logic-based abduction
    • Eiter, T., and Gottlob, G. 1995. The complexity of logic-based abduction. Journal of the ACM (JACM) 42(l):3-42.
    • (1995) Journal of the ACM (JACM) , vol.42 , Issue.L , pp. 3-42
    • Eiter, T.1    Gottlob, G.2
  • 11
    • 57749091037 scopus 로고    scopus 로고
    • Evaluating the adequacy of automated benchmark model generators for model-based diagnostic inference
    • Provan, G., and Wang, J. 2007. Evaluating the adequacy of automated benchmark model generators for model-based diagnostic inference. In Proceedings of IJCAI-07.
    • (2007) Proceedings of IJCAI-07
    • Provan, G.1    Wang, J.2
  • 12
    • 0032045818 scopus 로고    scopus 로고
    • Computation of Prime Implicants using Matrix and Paths
    • Shiny, A., and Pujari, A. 2002. Computation of Prime Implicants using Matrix and Paths. Journal of Logic and Computation 8(2): 135-145.
    • (2002) Journal of Logic and Computation , vol.8 , Issue.2 , pp. 135-145
    • Shiny, A.1    Pujari, A.2
  • 13
    • 0037192367 scopus 로고    scopus 로고
    • The nonapproximability of obdd minimization
    • Sieling, D. 2002. The nonapproximability of obdd minimization. Inf. Comput. 172(2): 103-138.
    • (2002) Inf. Comput , vol.172 , Issue.2 , pp. 103-138
    • Sieling, D.1


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