Electronic Resource
Oxford, UK
:
Blackwell Publishing Ltd
Computational intelligence
12 (1996), S. 0
ISSN:
1467-8640
Source:
Blackwell Publishing Journal Backfiles 1879-2005
Topics:
Computer Science
Notes:
This article presents our work on the effective implementation of abduction in temporal reasoning. This works builds on some results, both in the logic programming field and in the automated reasoning area. We have defined and implemented an abductive procedure, which is well adapted for temporal reasoning because it is based on a constrained resolution principle. Constrained resolution has two advantages for temporal reasoning: First, it allows us to deal efficiently with temporal ordering and equality predicates, which are otherwise too much trouble with classical resolution; second, it allows a restricted form of abduction where hypotheses are limited to ordering relationships. From the logic programming area, our work uses results and procedures developed by others in the abductive logic programming field. The procedure we define and implement in this work is relatively independent of the temporal formalism: It has been used with some reified temporal logics and with the event calculus. More generally it can be used on any point-based temporal formalism, provided that a correct and complete algorithm is available for checking the consistency of a set of temporal ordering relationships in this language.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1111/j.1467-8640.1996.tb00268.x
Permalink
|
Location |
Call Number |
Expected |
Availability |
