Probabilistic Abductive Logic Programming in Constraint Handling Rules

Publikation: KonferencebidragPaperForskningpeer review

Abstract

A class of Probabilistic Abductive Logic Programs (PALPs) is introduced
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.

OriginalsprogEngelsk
Publikationsdato2008
Antal sider15
StatusUdgivet - 2008
BegivenhedCSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming - Rom, Italien
Varighed: 18 jun. 200820 jun. 2008

Konference

KonferenceCSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming
LandItalien
ByRom
Periode18/06/200820/06/2008

Bibliografisk note

Proceedings produceret lokal som CD-ROM; intet nr.

Citer dette