1071 search results - page 185 / 215 » Modal Logics, Description Logics and Arithmetic Reasoning |
WWW
2011
ACM
14 years 4 months ago
2011
ACM
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
ECBS
2008
IEEE
14 years 11 months ago
2008
IEEE
Large and complex software systems require expressive notations for representing their software architecture. In this context Architecture Description Languages (ADLs) can be used...