Sciweavers

1435 search results - page 169 / 287
» E-connections of Description Logics
Sort
View
LFCS
2009
Springer
15 years 8 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
JELIA
2004
Springer
15 years 6 months ago
Computing the Least Common Subsumer w.r.t. a Background Terminology
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 5 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 3 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 2 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