Publications

BibTex format

@inproceedings{Aspis:2018,
author = {Aspis, Y and Broda, K and Russo, A},
pages = {68--75},
publisher = {CEUR Workshop Proceedings},
title = {Tensor-based abduction in horn propositional programs},
url = {http://hdl.handle.net/10044/1/64299},
year = {2018}
}

Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - 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.
AU  - Aspis,Y
AU  - Broda,K
AU  - Russo,A
EP  - 75
PB  - CEUR Workshop Proceedings
PY  - 2018///
SN  - 1613-0073
SP  - 68
TI  - Tensor-based abduction in horn propositional programs
UR  - http://hdl.handle.net/10044/1/64299
ER  -

Download

DrKrysiaBroda

Contact

Location

Summary

Citation

BibTex format

RIS format (EndNote, RefMan)