Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning
Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits · Lecture notes in computer science · 2006
Towards providing a suitable tool for building the Rule Layer of the Semantic Web, hex -programs have been introduced as a special kind of logic programs featuring capabilities for higher-order reasoning, interfacing with external sources of computation, and default negation. Their semantics is based on the notion of answer sets, providing a transparent interoperability with the Ontology Layer of the Semantic Web and full declarativity. In this paper, we identify classes of hex -programs feasible for implementation yet keeping the desirable advantages of the full language. A general method for combining and evaluating sub-programs belonging to arbitrary classes is introduced, thus enlarging the variety of programs whose execution is practicable. Implementation activity on the current prototype is also reported. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.