Computing Abduction in Semantic Tableaux

Abstract. The aim o/ this paper is to propose a way to extend the framework o/ semantic tableaux in order ta compute several /orma o/ abductive explanations: atomic, conjunctive and in disjunctive formo Our /ocus is on computing consistenf. explanations. 'fflat is, lormulas which satisfy the em...

Descripción completa

Detalles Bibliográficos
Autor: Aliseda, Atocha
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:1998
País:México
Institución:Instituto Politécnico Nacional
Repositorio:Repositorio Digital del IPN
OAI Identifier:oai:www.repositoriodigital.ipn.mx:123456789/15101
Acceso en línea:http://www.repositoriodigital.ipn.mx/handle/123456789/15101
Access Level:acceso abierto
Palabra clave:Keywords. Abduction, Abductive Programming, Semantic Tableaux.
Descripción
Sumario:Abstract. The aim o/ this paper is to propose a way to extend the framework o/ semantic tableaux in order ta compute several /orma o/ abductive explanations: atomic, conjunctive and in disjunctive formo Our /ocus is on computing consistenf. explanations. 'fflat is, lormulas which satisfy the emailment and the consistency condition 01 the standard logical lormulation 01 abduction. Our stmtegy lor computing abductive explanations avoids the constroction 01 inconsistencies and it is done in a compositional lashion¡ abductive explanations with complez /orma are corutrocted fromsimpler ones. This allows us to identify special C41es, lor ezample that in which there are no consistent atomic explanations whatSDever.