Brasil | Artículos de revistas
dc.creatorFinger, Marcelo
dc.date.accessioned2013-10-23T13:11:43Z
dc.date.accessioned2018-07-04T16:00:55Z
dc.date.available2013-10-23T13:11:43Z
dc.date.available2018-07-04T16:00:55Z
dc.date.created2013-10-23T13:11:43Z
dc.date.issued2012
dc.identifierLOGIC JOURNAL OF THE IGPL, OXFORD, v. 20, n. 2, Special Issue, supl. 1, Part 1, pp. 370-387, APR, 2012
dc.identifier1367-0751
dc.identifierhttp://www.producao.usp.br/handle/BDPI/35653
dc.identifier10.1093/jigpal/jzq052
dc.identifierhttp://dx.doi.org/10.1093/jigpal/jzq052
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1630479
dc.description.abstractTraditional abduction imposes as a precondition the restriction that the background information may not derive the goal data. In first-order logic such precondition is, in general, undecidable. To avoid such problem, we present a first-order cut-based abduction method, which has KE-tableaux as its underlying inference system. This inference system allows for the automation of non-analytic proofs in a tableau setting, which permits a generalization of traditional abduction that avoids the undecidable precondition problem. After demonstrating the correctness of the method, we show how this method can be dynamically iterated in a process that leads to the construction of non-analytic first-order proofs and, in some terminating cases, to refutations as well.
dc.languageeng
dc.publisherOXFORD UNIV PRESS
dc.publisherOXFORD
dc.relationLOGIC JOURNAL OF THE IGPL
dc.rightsCopyright OXFORD UNIV PRESS
dc.rightsclosedAccess
dc.subjectABDUCTION
dc.subjectFIRST-ORDER ABDUCTION
dc.subjectCUT-BASED ABDUCTION
dc.subjectTABLEAUX
dc.subjectFIRST-ORDER TABLEAUX
dc.titleTowards automated first-order abduction: the cut-based approach
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución