Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Resumé

Constraint Handling Rules (CHR) is an extension to Prolog which opens up
a  spectrum of hypotheses-based reasoning in logic programs without
additional interpretation overhead.
Abduction with integrity constraints is one example of hypotheses-based reasoning which can be
implemented directly in Prolog and CHR with a straightforward use of available
and efficiently implemented facilities.

The present paper clarifies the semantic foundations for this way of doing
abduction in CHR and Prolog as well as other examples 
of hypotheses-based reasoning that is possible,
including assumptive logic programming, hypotheses with priority and scope,
and nonmonotonic reasoning.

Examples are presented as executable code so the paper may also serve 
the additional purpose of a practical guide for developing such programs,
and it is demonstrated that the approach provides a seamless  integration
with existing constraint solvers

OriginalsprogEngelsk
TidsskriftJournal of Applied Logic
Vol/bind7
Udgave nummer3
Sider (fra-til)341-362
ISSN1570-8683
DOI
StatusUdgivet - 2009

Citer dette

@article{c92c15603e0d11deafa5000ea68e967b,
title = "Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules",
abstract = "Constraint Handling Rules (CHR) is an extension to Prolog which opens upa  spectrum of hypotheses-based reasoning in logic programs withoutadditional interpretation overhead.Abduction with integrity constraints is one example of hypotheses-based reasoning which can beimplemented directly in Prolog and CHR with a straightforward use of availableand efficiently implemented facilitiesThe present paper clarifies the semantic foundations for this way of doingabduction in CHR and Prolog as well as other examples of hypotheses-based reasoning that is possible,including assumptive logic programming, hypotheses with priority and scope,and nonmonotonic reasoning.Examples are presented as executable code so the paper may also serve the additional purpose of a practical guide for developing such programs,and it is demonstrated that the approach provides a seamless  integrationwith existing constraint solvers.",
author = "Henning Christiansen",
year = "2009",
doi = "10.1016/j.jal.2008.10.004",
language = "English",
volume = "7",
pages = "341--362",
journal = "Journal of Applied Logic",
issn = "1570-8683",
publisher = "Elsevier BV",
number = "3",

}

Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules. / Christiansen, Henning.

I: Journal of Applied Logic, Bind 7, Nr. 3, 2009, s. 341-362.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

TY - JOUR

T1 - Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules

AU - Christiansen, Henning

PY - 2009

Y1 - 2009

N2 - Constraint Handling Rules (CHR) is an extension to Prolog which opens upa  spectrum of hypotheses-based reasoning in logic programs withoutadditional interpretation overhead.Abduction with integrity constraints is one example of hypotheses-based reasoning which can beimplemented directly in Prolog and CHR with a straightforward use of availableand efficiently implemented facilitiesThe present paper clarifies the semantic foundations for this way of doingabduction in CHR and Prolog as well as other examples of hypotheses-based reasoning that is possible,including assumptive logic programming, hypotheses with priority and scope,and nonmonotonic reasoning.Examples are presented as executable code so the paper may also serve the additional purpose of a practical guide for developing such programs,and it is demonstrated that the approach provides a seamless  integrationwith existing constraint solvers.

AB - Constraint Handling Rules (CHR) is an extension to Prolog which opens upa  spectrum of hypotheses-based reasoning in logic programs withoutadditional interpretation overhead.Abduction with integrity constraints is one example of hypotheses-based reasoning which can beimplemented directly in Prolog and CHR with a straightforward use of availableand efficiently implemented facilitiesThe present paper clarifies the semantic foundations for this way of doingabduction in CHR and Prolog as well as other examples of hypotheses-based reasoning that is possible,including assumptive logic programming, hypotheses with priority and scope,and nonmonotonic reasoning.Examples are presented as executable code so the paper may also serve the additional purpose of a practical guide for developing such programs,and it is demonstrated that the approach provides a seamless  integrationwith existing constraint solvers.

U2 - 10.1016/j.jal.2008.10.004

DO - 10.1016/j.jal.2008.10.004

M3 - Journal article

VL - 7

SP - 341

EP - 362

JO - Journal of Applied Logic

JF - Journal of Applied Logic

SN - 1570-8683

IS - 3

ER -