Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
From Logic to Logic Programming
From Logic to Logic Programming
Sorted HiLog: Sorts in Higher-Order Logic Data Languages
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
On the Properties of Metamodeling in OWL1
Journal of Logic and Computation
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Distributed reasoning with ontologies and rules in order-sorted logic programming
Web Semantics: Science, Services and Agents on the World Wide Web
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Meta-relation and ontology closure in conceptual structure theory
Artificial Intelligence and Law
Query Answering for OWL-DL with rules
Web Semantics: Science, Services and Agents on the World Wide Web
On the decidability and complexity of integrating ontologies and rules
Web Semantics: Science, Services and Agents on the World Wide Web
Integrated metamodeling and diagnosis in OWL 2
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
| Hi-index | 0.00 |
In the Semantic Web context, the meta-modeling of concepts in ontologies and rules is required for defining the meanings of upper-level data and vocabularies. For this purpose, we propose a decidable fragment of order-sorted logic programming with hyper-predicate hierarchies. In the sorted language, we can employ simple- and hyper-predicates to express the concepts of sorts, predicates, and meta-predicates by unifying and enhancing them in a hyper-predicate hierarchy. The sorted Horn-clause calculus is extended to develop a query-answering system that can answer queries such as atoms and hyper-atoms generalized to contain predicate variables. We show that each query is computable in NEXPTIME if knowledge bases are function-free and safe. Furthermore, the computation can be reduced to EXPTIME if additional arguments in super-predicates and multiple predicate declarations are restricted.