Probabilistic Abductive Logic Programming in Constraint Handling Rules

Research output: Contribution to conferencePaperResearchpeer-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.


Original languageEnglish
Publication date2008
Number of pages15
Publication statusPublished - 2008
EventCSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming - Rom, Italy
Duration: 18 Jun 200820 Jun 2008

Conference

ConferenceCSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming
CountryItaly
CityRom
Period18/06/200820/06/2008

Cite this

Christiansen, H. (2008). Probabilistic Abductive Logic Programming in Constraint Handling Rules. Paper presented at CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming, Rom, Italy.
Christiansen, Henning. / Probabilistic Abductive Logic Programming in Constraint Handling Rules. Paper presented at CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming, Rom, Italy.15 p.
@conference{13d38610e3dd11dda5ae000ea68e967b,
title = "Probabilistic Abductive Logic Programming in Constraint Handling Rules",
abstract = "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.",
author = "Henning Christiansen",
note = "Proceedings produceret lokal som CD-ROM; intet nr.; null ; Conference date: 18-06-2008 Through 20-06-2008",
year = "2008",
language = "English",

}

Christiansen, H 2008, 'Probabilistic Abductive Logic Programming in Constraint Handling Rules' Paper presented at, Rom, Italy, 18/06/2008 - 20/06/2008, .

Probabilistic Abductive Logic Programming in Constraint Handling Rules. / Christiansen, Henning.

2008. Paper presented at CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming, Rom, Italy.

Research output: Contribution to conferencePaperResearchpeer-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 -

Christiansen H. Probabilistic Abductive Logic Programming in Constraint Handling Rules. 2008. Paper presented at CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming, Rom, Italy.