Sciweavers

140 search results - page 23 / 28
» On Expressive Number Restrictions in Description Logics
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 12 months ago
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...
Randal E. Bryant, Steven M. German, Miroslav N. Ve...
ICLP
1997
Springer
13 years 11 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
SEMWEB
2010
Springer
13 years 5 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
OWLED
2007
13 years 9 months ago
Lege Feliciter: Using Structured English to represent a Topographic Hydrology Ontology
: The mathematical nature of description logics has meant that domain experts find it hard to understand. This forms a significant impediment to the creation and adoption of ontolo...
Glen Hart, Catherine Dolbear, John Goodwin
PODS
2010
ACM
181views Database» more  PODS 2010»
14 years 20 days ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick