✦ LIBER ✦

On the decidability and complexity of integrating ontologies and rules

✍ Scribed by Riccardo Rosati

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 180 KB
Volume: 3
Category: Article
ISSN: 1570-8268
DOI: 10.1016/j.websem.2005.05.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the decidability and complexity of re

On the decidability and complexity of reasoning about only knowing

✍ Riccardo Rosati 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 205 KB

We study reasoning in Levesque's logic of only knowing. In particular, we first prove that extending a decidable subset of first-order logic with the ability of reasoning about only knowing preserves decidability of reasoning, as long as quantifying-in is not allowed in the language, and define a ge

The ontologies of complexity and learnin

The ontologies of complexity and learning about complex systems

✍ Michael J. Jacobson; Manu Kapur; Hyo-Jeong So; June Lee 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 547 KB

The GPR system: An architecture for inte

The GPR system: An architecture for integrating active and deductive rules on complex database objects

✍ Angiulli, Fabrizio; Palopoli, Luigi; Torlone, Riccardo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

This paper illustrates a prototype system, called GPRS, supporting the Generalized Production Rules (GPR) data-base language. The GPR language integrates, in a unified framework, active rules, which allow the specification of event driven computations on data, and deductive rules, which can be used

Completeness, decidability and complexit

Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary

✍ Herman J. ter Horst 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 496 KB

We prove that entailment for RDF Schema (RDFS) is decidable, NP-complete, and in P if the target graph does not contain blank nodes. We show that the standard set of entailment rules for RDFS is incomplete and that this can be corrected by allowing blank nodes in predicate position. We define seman

Analytical description of the evolution

Analytical description of the evolution of neural networks: learning rules and complexity

✍ K. Holthausen; O. Breidbach 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 161 KB

A note on the refinement of ontologies

✍ Grigoris Antoniou; Athanasios Kehagias 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

Ontologies have emerged as one of the key issues in information integration and interoperability and in their application to knowledge management and electronic commerce. A trend towards formal methods for ontology management is obvious. This paper discusses a concept which can be expected to be of