메뉴 건너뛰기




Volumn 1106, Issue , 1996, Pages 151-170

Defeasible constraint solving

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); CONSTRAINT THEORY; LOGIC PROGRAMMING;

EID: 21344469404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61479-6_20     Document Type: Conference Paper
Times cited : (5)

References (17)
  • 3
    • 0003498063 scopus 로고
    • Exploring Artificial Intelligence, chapter 8, Morgan Kaufmann Publisher, INC
    • R. Davis and W. Hamscher. Model-based Reasoning: Troubleshooting. Exploring Artificial Intelligence, chapter 8, pages 297-379. Morgan Kaufmann Publisher, INC., 1988.
    • (1988) Model-Based Reasoning: Troubleshooting , pp. 297-379
    • Davis, R.1    Hamscher, W.2
  • 4
    • 0022677462 scopus 로고
    • Problem Solving with the ATMS
    • J. de Kleer. Problem Solving with the ATMS. Artificial Intelligence, 28:197-224, 1986.
    • (1986) Artificial Intelligence , vol.28 , pp. 197-224
    • De Kleer, J.1
  • 5
    • 0018544688 scopus 로고
    • A Truth Maintenance System
    • J. Doyle. A Truth Maintenance System. Artificial Intelligence, 12:231-272, 1979.
    • (1979) Artificial Intelligence , vol.12 , pp. 231-272
    • Doyle, J.1
  • 8
    • 0002514541 scopus 로고
    • Algorithms for Constraint-Satisfaction-Problems: A Survey
    • Spring
    • Vipin Kumar. Algorithms for Constraint-Satisfaction-Problems: A Survey. AI Magazine, pages 32-44, Spring 1992.
    • (1992) AI Magazine , pp. 32-44
    • Kumar, V.1
  • 9
    • 49449120803 scopus 로고
    • Consistency in Networks of Relations
    • Alan K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8:99-118, 1977.
    • (1977) Artificial Intelligence , vol.8 , pp. 99-118
    • Mackworth, A.K.1
  • 10
    • 0021828305 scopus 로고
    • The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems
    • Alan K. Mackworth and Eugene C. Freuder. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. Artificial Intelligence, 25:65-74, 1985.
    • (1985) Artificial Intelligence , vol.25 , pp. 65-74
    • Mackworth, A.K.1    Freuder, E.C.2
  • 11
    • 84957904586 scopus 로고
    • Preliminary Formalization of an Incremental Hierarchical Constraint Solver
    • Porto, October
    • F. Menezes and P. Barahona. Preliminary Formalization of an Incremental Hierarchical Constraint Solver. In Proceedings of EPIA’93, Porto, October 1993.
    • (1993) Proceedings of EPIA’93
    • Menezes, F.1    Barahona, P.2
  • 14
    • 0003485296 scopus 로고
    • Deduction Revision by Intelligent Backtracking
    • J. A. Campbell
    • Luis Moniz Pereira and M. Bruynooghe. Deduction Revision by Intelligent Backtracking. Implementations of Prolog, pages 194-215. J. A. Campbell, 1984.
    • (1984) Implementations of Prolog , pp. 194-215
    • Pereira, L.M.1    Bruynooghe, M.2
  • 15
    • 0024066001 scopus 로고
    • A Logical Framework for Default Reasoning
    • D. Poole. A Logical Framework for Default Reasoning. Artificial Intelligence, 36:27-47, 1988.
    • (1988) Artificial Intelligence , vol.36 , pp. 27-47
    • Poole, D.1


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