๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Conditional reasoning in logic programming

โœ Scribed by D. Gabbay; L. Giordano; A. Martelli; N. Olivetti; M.L. Sapino


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
286 KB
Volume
44
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

โœฆ Synopsis


We introduce a logic programming language which supports hypothetical and counterfactual reasoning. The language is based on a conditional logic which enables to formalize conditional updates of the knowledge base. Due to the presence of integrity constraints, alternative revisions of the knowledge base may result from an update. We develop an abductive semantics which captures dierent evolutions of the knowledge base. Furthermore, we provide a goal-directed abductive proof procedure to compute the alternative solutions for a goal. We ยฎnally analyze our conditional programming language in the context of belief revision theory, and we establish a connection with Nebel's prioritized base revision.


๐Ÿ“œ SIMILAR VOLUMES


Prioritized logic programming and its ap
โœ Chiaki Sakama; Katsumi Inoue ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 284 KB

Representing and reasoning with priorities are important in commonsense reasoning. This paper introduces a framework of prioritized logic programming (PLP), which has a mechanism of explicit representation of priority information in a program. When a program contains incomplete or indefinite informa

From ordering-based nonmonotonic reasoni
โœ Luis Fariรฑas del Cerro; Andreas Herzig; Jรฉrรดme Lang ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1001 KB

Farifias del Cerro, L., A. Herzig and J. Lang, From ordering-based nonmonotonic reasoning to conditional logics, Artificial Intelligence 66 (1994) 375-393. As G~irdenfors and Makinson have recently shown, a nonmonotonic inference relation can be generated from a total pre-ordering on the set of for