Mechanising shared configuration and diagnosis theories through constraint logic programming

Configuration and diagnosis problem-solvers are commonly championed as successes of applied artificial intelligence techniques. A common problem is that problem-solvers typically encode task-specific representation assumptions and simplifications in their domain theories, hindering the reuse of the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The journal of logic programming Ročník 37; číslo 1; s. 255 - 283
Hlavní autoři: Sharma, Nirad, Colomb, Robert
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.10.1998
Témata:
ISSN:0743-1066, 1873-5789
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Configuration and diagnosis problem-solvers are commonly championed as successes of applied artificial intelligence techniques. A common problem is that problem-solvers typically encode task-specific representation assumptions and simplifications in their domain theories, hindering the reuse of the domain theories between the problem-solvers. While model-based reasoning techniques have been shown to provide an interesting approach to sharing component and device specifications, their respective mechanisations are generally too inefficient. We show how constraint logic programming languages provide a flexible environment in which constraint-based specifications can be effectively shared and efficiently mechanised by exploiting constraint solving and propagation techniques tightly integrated with the backtracking search mechanism of logic programming languages. A component specification language is presented and the mappings from the language to the constraint system and strategies for guiding the search are defined for the respective problem-solvers.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0743-1066
1873-5789
DOI:10.1016/S0743-1066(98)10010-9