메뉴 건너뛰기




Volumn , Issue , 2007, Pages 2611-2618

Logical circuit filtering

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT REPRESENTATION; DETERMINISTIC DOMAINS; FILTERING ALGORITHM; ORDERS OF MAGNITUDE; REASONING ALGORITHMS; SEQUENCE LENGTHS; SEQUENCE OF ACTIONS; STOCHASTIC DOMAINS;

EID: 84860587903     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (14)
  • 2
    • 84880886485 scopus 로고    scopus 로고
    • Heuristic search + symbolic model checking = efficient conformant planning
    • MK
    • P. Bertoli, A. Cimatti, and M. Roveri. Heuristic search + symbolic model checking = efficient conformant planning. In IJCAI '01. MK, 2001.
    • (2001) IJCAI '01
    • Bertoli, P.1    Cimatti, A.2    Roveri, M.3
  • 3
  • 4
    • 0026913667 scopus 로고
    • Symbolic Boolean manipulation with ordered binary-decision diagrams
    • R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 1992.
    • (1992) ACM Computing Surveys
    • Bryant, R.E.1
  • 5
    • 0013365496 scopus 로고    scopus 로고
    • Conformant planning via symbolic model checking
    • A. Cimatti and M. Roveri. Conformant planning via symbolic model checking. JAIR, 2000.
    • (2000) JAIR
    • Cimatti, A.1    Roveri, M.2
  • 7
    • 33749562704 scopus 로고    scopus 로고
    • Combining strengths of circuit-based and cnf-based algorithms for a high-performance sat solver
    • M. K. Ganai, P. Ashar, A. Gupta, L. Zhang, and S. Malik. Combining strengths of circuit-based and cnf-based algorithms for a high-performance sat solver. In DAC, 2002.
    • (2002) DAC
    • Ganai, M.K.1    Ashar, P.2    Gupta, A.3    Zhang, L.4    Malik, S.5
  • 8
    • 0342427620 scopus 로고    scopus 로고
    • The complexity of the language A
    • P. Liberatore. The complexity of the language A. ETAI, 1997.
    • (1997) ETAI
    • Liberatore, P.1
  • 9
    • 0031146160 scopus 로고    scopus 로고
    • How to progress a database
    • F. Lin and R. Reiter. How to progress a database. AIJ, 1997.
    • (1997) AIJ
    • Lin, F.1    Reiter, R.2
  • 10
    • 0038220797 scopus 로고    scopus 로고
    • Technical report, Institute of Information Technology, Technical University of Denmark
    • J. Lind-Nielsen. Buddy - a binary decision diagram package. Technical report, Institute of Information Technology, Technical University of Denmark, 1999.
    • (1999) Buddy - A Binary Decision Diagram Package
    • Lind-Nielsen, J.1
  • 11
    • 13444272270 scopus 로고    scopus 로고
    • Extending the knowledge-based approach to planning with incomplete information and sensing
    • AAAI Press
    • R.P.A. Petrick and F. Bacchus. Extending the knowledge-based approach to planning with incomplete information and sensing. In ICAPS-04. AAAI Press, 2004.
    • (2004) ICAPS-04
    • Petrick, R.P.A.1    Bacchus, F.2
  • 12
    • 0002048328 scopus 로고
    • The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
    • Academic Press
    • R. Reiter. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In Artificial Intelligence and Mathematical Theory of Computation. Academic Press, 1991.
    • (1991) Artificial Intelligence and Mathematical Theory of Computation
    • Reiter, R.1


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