Integrating answer set programming and constraint logic programming

We introduce a knowledge representation language extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, , for computing answer sets of programs. The algorithm does not require full grounding of a program and combines “classical” ASP solving...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of mathematics and artificial intelligence Ročník 53; číslo 1-4; s. 251 - 287
Hlavní autoři: Mellarkod, Veena S., Gelfond, Michael, Zhang, Yuanlin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Netherlands 01.08.2008
Springer Nature B.V
Témata:
Abduction
Algorithms
Artificial Intelligence
Chromium
Complex Systems
Computer Science
Declarative programming
Expert systems
Knowledge representation
Logic programming
Mathematical analysis
Mathematical programming
Mathematics
Programming
Prolog
Semantics
Solvers
68T20
68T27
03B70
Answer set programming
68T35
Constraint logic programming
Knowledge representation and reasoning
68T30
ISSN:1012-2443, 1573-7470
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í:We introduce a knowledge representation language extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, , for computing answer sets of programs. The algorithm does not require full grounding of a program and combines “classical” ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1012-2443
1573-7470
DOI:10.1007/s10472-009-9116-y