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
Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
Order-sorted logic programming with predicate hierarchy
Artificial Intelligence
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
An Ontology Formalization of Relation Type Hierarchy in Conceptual Structure Theory
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Distributed reasoning with ontologies and rules in order-sorted logic programming
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
An order-sorted quantified modal logic for meta-ontology
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Deduction Systems
Existential rigidity and many modalities in order-sorted logic
Knowledge-Based Systems
Sorted hyper-predicate knowledge bases for ontologies and rules
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe order-sorted logic programming with sort, predicate, and meta-predicate hierarchies for deriving predicate and meta-predicate assertions. Meta-level predicates (predicates of predicates) are useful for representing relationships between predicate formulas, and further, they conceptually yield a hierarchy similar to the hierarchies of sorts and predicates. By extending the order-sorted Horn-clause calculus, we develop a query-answering system that can answer queries such as atoms and meta-atoms generalized by containing predicate variables. We show that the expressive query-answering system computes every generalized query in single exponential time, i.e., the complexity of our query system is equal to that of DATALOG.