Decomposition of Declarative Knowledge Bases with External Functions
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 752-757.
Abstract
We present a method to decompose a declarative knowledge base, given by a logic program under Answer Set Semantics with access to external sources. It overcomes the ineffectiveness of current methods due to a lack of structural information about these sources, viewed as black boxes, by exploiting independency information in accesses to them. To this end, we develop a generic notion of domain independence that allows to restrict the evaluation domain and, as a consequence, to prune unnecessary dependency assumptions between atoms. This leads to increased decomposability, which we demonstrate by an evaluation method for HEX-programs based on program rewriting. Experiments show that this may yield large performance gains. While developed for a particular formalism, the notions and ideas of this paper might be adapted to related formalisms as well.Thomas Eiter, Michael Fink, Thomas Krennwallner
@inproceedings{ijcai2009p130,
title = {Decomposition of Declarative Knowledge Bases with External Functions},
author = {Eiter, Thomas and Fink, Michael and Krennwallner, Thomas},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {752--757},
year = {2009},
url = {https://ijcai.org/proceedings/2009/130},
}
TY - CPAPER TI - Decomposition of Declarative Knowledge Bases with External Functions AU - Eiter, Thomas AU - Fink, Michael AU - Krennwallner, Thomas T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 752 EP - 757 UR - https://ijcai.org/proceedings/2009/130 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
