Sciweavers

140 search results - page 21 / 28
» On Expressive Number Restrictions in Description Logics
Sort
View
JOLLI
2008
95views more  JOLLI 2008»
13 years 7 months ago
Relational Modality
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
Kathrin Glüer, Peter Pagin
ENTCS
2006
123views more  ENTCS 2006»
13 years 7 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris
FCCM
2008
IEEE
177views VLSI» more  FCCM 2008»
14 years 2 months ago
Hardware Scripting in Gel
—Gel is a hardware description language that enables quick scripting of high level designs and can be easily extended to new design patterns. It is expression oriented and extrem...
Jonathan Bachrach, Dany Qumsiyeh, Mark Tobenkin
CSL
2010
Springer
13 years 8 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter