Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules

Research output: Contribution to journalJournal articleResearchpeer-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 transformed 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
Book seriesLecture Notes in Computer Science
Volume5388
Pages (from-to)85-118
ISSN0302-9743
Publication statusPublished - 2008

Cite this

@article{a01625b0e3d811dda5ae000ea68e967b,
title = "Implementing Probabilistic Abductive Logic Programming with 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 transformed 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 = "Undertitel p{\aa} bind: {"}Constraint Handling Rules, Current Research Topics{"} Schrijvers, Tom; Fr{\"u}hwirth, Thom (Eds.) ISBN: 978-3-540-92242-1",
year = "2008",
language = "English",
volume = "5388",
pages = "85--118",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Physica-Verlag",

}

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

In: Lecture Notes in Computer Science, Vol. 5388, 2008, p. 85-118.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules

AU - Christiansen, Henning

N1 - Undertitel på bind: "Constraint Handling Rules, Current Research Topics" Schrijvers, Tom; Frühwirth, Thom (Eds.) ISBN: 978-3-540-92242-1

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 transformed 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 transformed 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 - Journal article

VL - 5388

SP - 85

EP - 118

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -