Resumé
and an implementation is developed in CHR for solving
abductive problems, providing minimal explanations with their
probabilities.
Both all-explanations and most-probable-explanations versions are given.
%
Compared with other probabilistic versions of
abductive logic programming, the approach is characterized by
higher generality and a flexible and adaptable
architecture which incorporates integrity constraints and interaction
with external constraint solvers.
%
A PALP is translated in a systematic way into a CHR program which serves
as a query interpreter, and the resulting CHR code describes in a highly
concise way, the strategies applied in the search for explanations.
| Originalsprog | Engelsk |
|---|---|
| Publikationsdato | 2008 |
| Antal sider | 15 |
| Status | Udgivet - 2008 |
| Begivenhed | CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming - Rom, Italien Varighed: 18 jun. 2008 → 20 jun. 2008 |
Konference
| Konference | CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming |
|---|---|
| Land | Italien |
| By | Rom |
| Periode | 18/06/2008 → 20/06/2008 |
Bibliografisk note
Proceedings produceret lokal som CD-ROM; intet nr.Citer dette
}
Probabilistic Abductive Logic Programming in Constraint Handling Rules. / Christiansen, Henning.
2008. Afhandling præsenteret på CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming, Rom, Italien.Publikation: Konferencebidrag › Paper › Forskning › peer review
TY - CONF
T1 - Probabilistic Abductive Logic Programming in Constraint Handling Rules
AU - Christiansen, Henning
N1 - Proceedings produceret lokal som CD-ROM; intet nr.
PY - 2008
Y1 - 2008
N2 - A class of Probabilistic Abductive Logic Programs (PALPs) is introducedand an implementation is developed in CHR for solvingabductive problems, providing minimal explanations with theirprobabilities.Both all-explanations and most-probable-explanations versions are given.%Compared with other probabilistic versions ofabductive logic programming, the approach is characterized byhigher generality and a flexible and adaptablearchitecture which incorporates integrity constraints and interactionwith external constraint solvers.%A PALP is translated in a systematic way into a CHR program which servesas a query interpreter, and the resulting CHR code describes in a highlyconcise way, the strategies applied in the search for explanations.
AB - A class of Probabilistic Abductive Logic Programs (PALPs) is introducedand an implementation is developed in CHR for solvingabductive problems, providing minimal explanations with theirprobabilities.Both all-explanations and most-probable-explanations versions are given.%Compared with other probabilistic versions ofabductive logic programming, the approach is characterized byhigher generality and a flexible and adaptablearchitecture which incorporates integrity constraints and interactionwith external constraint solvers.%A PALP is translated in a systematic way into a CHR program which servesas a query interpreter, and the resulting CHR code describes in a highlyconcise way, the strategies applied in the search for explanations.
M3 - Paper
ER -