메뉴 건너뛰기




Volumn 135, Issue 1-2, 2002, Pages 199-234

Consistency restoration and explanations in dynamic CSPs - Application to configuration

Author keywords

Assumptions; Compilation; CSPs; Explanations; Interactive configuration; Restorations

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DATA STRUCTURES; DECISION SUPPORT SYSTEMS;

EID: 0036467697     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00162-X     Document Type: Article
Times cited : (180)

References (42)
  • 3
    • 0008137807 scopus 로고    scopus 로고
    • The satisfiability problem regarded as a constraint satisfaction problem
    • Budapest, Hungary
    • (1996) Proc. ECAI-96 , pp. 155-159
    • Bennaceur, H.1
  • 9
    • 0030416710 scopus 로고    scopus 로고
    • Computation of prime implicates and prime implicants by a variant of the Davis and Putnam procedure
    • Toulouse, France
    • (1996) Proc. ICTAI-96 , pp. 428-429
    • Castell, T.1
  • 13
  • 18
    • 0002059944 scopus 로고
    • Tractable databases: How to make propositional unit resolution complete through compilation
    • Bonn, Germany
    • (1994) Proc. KR-94 , pp. 551-561
    • Del Val, A.1
  • 37
    • 0030365398 scopus 로고    scopus 로고
    • Compilation for critically constrained knowledge bases
    • Portland, OR
    • (1996) Proc. AAAI-96 , pp. 510-515
    • Schrag, R.1
  • 40
  • 41
    • 0026961096 scopus 로고
    • Solving constraint satisfaction problems using finite state automata
    • San Jose, CA
    • (1992) Proc. AAAI-92 , pp. 453-458
    • Vempaty, N.R.1


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