| dc.creator | Aliseda, Atocha | |
| dc.date.accessioned | 2013-04-12T23:17:17Z | |
| dc.date.available | 2013-04-12T23:17:17Z | |
| dc.date.created | 2013-04-12T23:17:17Z | |
| dc.date.issued | 1998-09-17 | |
| dc.identifier | Revista Computación y Sistemas; Vol. 2 No. 1 | |
| dc.identifier | 1405-5546 | |
| dc.identifier | http://www.repositoriodigital.ipn.mx/handle/123456789/15101 | |
| dc.description.abstract | 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. | |
| dc.language | en_US | |
| dc.publisher | Revista Computación y Sistemas; Vol. 2 No. 1 | |
| dc.relation | Revista Computación y Sistemas;Vol. 2 No. 1 | |
| dc.subject | Keywords. Abduction, Abductive Programming, Semantic Tableaux. | |
| dc.title | Computing Abduction in Semantic Tableaux | |
| dc.type | Article | |
