Probabilistic Abductive Logic Programming in Constraint Handling Rules

Henning Christiansen

Probabilistic Abductive Logic Programming in Constraint Handling Rules

Henning Christiansen

Programming, Logic and Intelligent Systems

Research output: Contribution to conference › Paper › Research › peer-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 language	English
Publication date	2008
Number of pages	15
Publication status	Published - 2008
Event	CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming - Rom, Italy Duration: 18 Jun 2008 → 20 Jun 2008

Conference

Conference	CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming
Country/Territory	Italy
City	Rom
Period	18/06/2008 → 20/06/2008

Access to Document

http://pst.istc.cnr.it/CSCLP08/program/papers/ChristiansenCSCLP2008.pdf

Citation Styles

@conference{13d38610e3dd11dda5ae000ea68e967b,

title = "Probabilistic Abductive Logic Programming in Constraint Handling Rules",

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. ",

author = "Henning Christiansen",

note = "Proceedings produceret lokal som CD-ROM; intet nr.; CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming ; Conference date: 18-06-2008 Through 20-06-2008",

year = "2008",

language = "English",

}

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 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.

AB - 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.

M3 - Paper

T2 - CSCLP 2008Annual ERCIM Workshop onConstraint Solving and Constraint Logic Programming

Y2 - 18 June 2008 through 20 June 2008

ER -