Skip to main navigation Skip to search Skip to main content

An abductive proof procedure for reasoning about actions in modal logic programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we propose a modal approach for reasoning about actions in a logic programming framework. We introduce a modal language which makes use of abductive assumptions to deal with persistency, and provides a solution to the ramification problem, by allowing one-way "causal rules" to be defined among fiuents. We define the abductive semantics of the language and a goal directed abductive proof procedure to compute abductive solutions for a goal from a given domain description. Both the semantics and the procedure are defined within the argumentation framework. In particular, we focus on a specific semantics, which is essentially an extension of Dung's admissibility semantics to a modal setting. The proof procedure is proved to be sound with respect to this semantics.

Original languageEnglish
Title of host publicationNon-Monotonic Extensions of Logic Programming - 2nd International Workshop, NMELP 1996, Selected Papers
EditorsJurgen Dix, Luis Moniz Pereira, Teodor C. Przymusinski
PublisherSpringer Verlag
Pages132-150
Number of pages19
ISBN (Print)9783540628439
DOIs
Publication statusPublished - 1997
Externally publishedYes
Event2nd International Workshop on Non-Monotonic Extensions of Logic Programming, NMELP 1996 - Bad Honnef, Germany
Duration: 5 Sept 19966 Sept 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1216
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Workshop on Non-Monotonic Extensions of Logic Programming, NMELP 1996
Country/TerritoryGermany
CityBad Honnef
Period5/09/966/09/96

Fingerprint

Dive into the research topics of 'An abductive proof procedure for reasoning about actions in modal logic programming'. Together they form a unique fingerprint.

Cite this