Decomposition of declarative knowledge bases with external functions

摘要: We present a method to decompose declarative knowledge base, given by logic program under Answer Set Semantics with access external sources. It overcomes the ineffectiveness of current methods due lack structural information about these sources, viewed as black boxes, exploiting independency in accesses them. To this end, we develop generic notion domain independence that allows restrict evaluation and, consequence, prune unnecessary dependency assumptions between atoms. This leads increased decomposability; demonstrate an for HEX-programs based on rewriting, which may yield large performance gains. While developed particular formalism, notions and ideas paper might be adapted related formalisms well.