IRUS Total

Tensor-based abduction in horn propositional programs

File Description SizeFormat 
TensorAbduction.pdfPublished version719.44 kBAdobe PDFView/Open
Title: Tensor-based abduction in horn propositional programs
Authors: Aspis, Y
Broda, K
Russo, A
Item Type: Conference Paper
Abstract: This paper proposes an algorithm for computing solutions of abductive Horn propositional tasks using third-order tensors. We first introduce the notion of explanatory operator, a single-step operation based on inverted implication, and prove that minimal abductive solutions of a given Horn propositional task can be correctly computed using this operator. We then provide a mapping of Horn propositional programs into third-order tensors, which builds upon recent work on matrix representation of Horn programs. We finally show how this mapping can be used to compute the explanatory operator by tensor multiplication.
Issue Date: 2-Sep-2018
Date of Acceptance: 6-Jul-2018
URI: http://hdl.handle.net/10044/1/64299
ISSN: 1613-0073
Publisher: CEUR Workshop Proceedings
Start Page: 68
End Page: 75
Journal / Book Title: CEUR Workshop Proceedings
Volume: 2206
Copyright Statement: © 2018 The Author(s).
Conference Name: ILP 2018 - 28th International Conference on Inductive Logic Programming
Publication Status: Published
Start Date: 2018-09-02
Finish Date: 2018-09-04
Conference Place: Ferrara
Online Publication Date: 2018-09-02
Appears in Collections:Computing
Faculty of Engineering