Foundations of logic programming
Foundations of logic programming
A mechanical solution of Schubert's steamroller by many-sorted resolution
Artificial Intelligence
Login: A logic programming language with built-in inheritance
Journal of Logic Programming
A more expressive formulation of many sorted logic
Journal of Automated Reasoning
A many-sorted calculus based on resolution and paramodulation
A many-sorted calculus based on resolution and paramodulation
Journal of the ACM (JACM)
Recursive query processing: the power of logic
Theoretical Computer Science
Logic programming and databases
Logic programming and databases
Proceedings of the workshop on Sorts and types in artificial intelligence
Computational aspects of an order-sorted logic with term declarations
Computational aspects of an order-sorted logic with term declarations
A general framework for sorted deduction: fundamental results on hybrid reasoning
Proceedings of the first international conference on Principles of knowledge representation and reasoning
An order-sorted logic for knowledge representation systems
Artificial Intelligence
Introduction to many-sorted logic
Many-sorted logic and its applications
A resolution principle for constrained logics
Artificial Intelligence
Reasoning about knowledge
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
From logic programming to Prolog
From logic programming to Prolog
The resolution calculus
An order-sorted resolution in theory and practice
Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
Combining Horn rules and description logics in CARIN
Artificial Intelligence
{\cal A}{\cal L}-log: Integrating Datalog and Description Logics
Journal of Intelligent Information Systems
Termination proofs for logic programs with tabling
ACM Transactions on Computational Logic (TOCL)
Identity criteria and sortal concepts
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Towards a consistent logical framework for ontological analysis
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Conceptual analysis of lexical taxonomies: the case of WordNet top-level
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
From Logic to Logic Programming
From Logic to Logic Programming
Supporting ontological analysis of taxonomic relationships
Data & Knowledge Engineering - ER2000
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
The completeness of logic programming with sort predicates
Systems and Computers in Japan
The Description Logic Handbook
The Description Logic Handbook
Ontological analysis of taxonomic relationships
ER'00 Proceedings of the 19th international conference on Conceptual modeling
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
ISWC '09 Proceedings of the 8th International Semantic Web Conference
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 |
Integrating ontologies and rules on the Semantic Web enables software agents to interoperate between them; however, this leads to two problems. First, reasoning services in SWRL (a combination of OWL and RuleML) are not decidable. Second, no studies have focused on distributed reasoning services for integrating ontologies and rules in multiple knowledge bases. In order to address these problems, we consider distributed reasoning services for ontologies and rules with decidable and effective computation. In this paper, we describe multiple order-sorted logic programming that transfers rigid properties from knowledge bases. Our order-sorted logic contains types (rigid sorts), non-rigid sorts, and unary predicates that distinctly express essential sorts, non-essential sorts, and non-sortal properties. We formalize the order-sorted Horn-clause calculus for such properties in a single knowledge base. This calculus is extended by embedding rigid-property derivation for multiple knowledge bases, each of which can transfer rigid-property information from other knowledge bases. In order to enable the reasoning to be effective and decidable, we design a query-answering system that combines order-sorted linear resolution and rigid-property resolution as top-down algorithms.