Sciweavers

3244 search results - page 376 / 649
» Extensions to Description Logics
Sort
View
AIML
2004
15 years 8 months ago
Complexity of Strict Implication
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Félix Bou
OTM
2005
Springer
16 years 6 days ago
Spatio-temporal Schema Integration with Validation: A Practical Approach
We propose to enhance a schema integration process with a validation phase employing logic-based data models. In our methodology, we validate the source schemas against the data mo...
Anastasiya Sotnykova, Nadine Cullot, Christelle Va...
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
ESWS
2008
Springer
15 years 8 months ago
Rabbit: Developing a Control Natural Language for Authoring Ontologies
: The mathematical nature of description logics has meant that domain experts find them hard to understand. This forms a significant impediment to the creation and adoption of onto...
Glen Hart, Martina Johnson, Catherine Dolbear
EACL
1993
ACL Anthology
15 years 8 months ago
A Strategy for Dynamic Interpretation: a Fragment and an Implementation
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
Olivier Bouchez, Jan van Eijck, Olivier Istace