Por favor utiliza este link para citar o compartir este documento: http://repositoriodigital.academica.mx/jspui/handle/987654321/8531
Título: Computing Abduction in Semantic Tableaux
Computing Abduction in Semantic Tableaux
Autores: 
Palabras clave: ABDUCTION; ABDUCTIVE PROGRAMMING; SEMANTIC TABLEAUX
Fecha de publicación: 10-Sep-2011
Editorial: Computación y Sistemas
Descripción: THE AIM OF TIS PAPER IS TO PROPOSE A WAY TO EXTEND THE FRAMEWORK OF SEMANTIC TABLEAUX IN ORDEN TO COMPUTE SEVERAL FORMS OF ABDUCTIVE EXPLANATIONS: ATOMIC, CONJUCTIVE AND IN DISJUNTIVE FORM. OUR FOCUS IS ON COMPUTING CONSISTENT EXPLANATIONS. THAT IS, FORMULAS WHICH ATISFY THE ENTOILMENT AND THE CONSISTENCY CONDITION OF THE ATANDARD LOGICAL FORMULATION OF ABDUCTION. OUR STATEGY FOR COMPUTING ABDUCTIVE EXPLANATIONS AVOIDS THE CONSTRUCTION OG INCONSISTENCIES AND IT IS DONE IN A COMPLEX FORMS ARE CONSTRUCTED FROM SIMPLERS ONES. THIS ALLOWS US TO IDENTIFY SPECIAL CASES, FOR EXAMPLE THAT IN WHICH THERE ARE NO CONSISTENT ATOMIC EXPLANATIONS WHATSOEVER.
THE AIM OF TIS PAPER IS TO PROPOSE A WAY TO EXTEND THE FRAMEWORK OF SEMANTIC TABLEAUX IN ORDEN TO COMPUTE SEVERAL FORMS OF ABDUCTIVE EXPLANATIONS: ATOMIC, CONJUCTIVE AND IN DISJUNTIVE FORM. OUR FOCUS IS ON COMPUTING CONSISTENT EXPLANATIONS. THAT IS, FORMULAS WHICH ATISFY THE ENTOILMENT AND THE CONSISTENCY CONDITION OF THE ATANDARD LOGICAL FORMULATION OF ABDUCTION. OUR STATEGY FOR COMPUTING ABDUCTIVE EXPLANATIONS AVOIDS THE CONSTRUCTION OG INCONSISTENCIES AND IT IS DONE IN A COMPLEX FORMS ARE CONSTRUCTED FROM SIMPLERS ONES. THIS ALLOWS US TO IDENTIFY SPECIAL CASES, FOR EXAMPLE THAT IN WHICH THERE ARE NO CONSISTENT ATOMIC EXPLANATIONS WHATSOEVER.
Other Identifiers: http://revistas.unam.mx/index.php/cys/article/view/2442
Aparece en las Colecciones:Computación y Sistemas

Archivos de este documento:
No hay archivos asociados a este documento.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.