Sciweavers

1545 search results - page 150 / 309
» Defeasible Description Logics
Sort
View
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
14 years 2 months ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
LICS
1999
IEEE
14 years 10 days ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
TAMODIA
2008
13 years 9 months ago
Preserving Rich User Interface State in Web Applications across Various Platforms
This paper aims to provide thorough discussion of the aspects that compose the state of a Web application user interface, and show how it can be preserved across multiple devices w...
Fabio Paternò, Carmen Santoro, Antonio Scor...
CSL
1999
Springer
14 years 11 days ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
EDOC
2004
IEEE
13 years 11 months ago
A Logical Viewpoint on Architectures
In this paper we introduce a logical viewpoint on architectures. The logical viewpoint is based on the distinction between symbolic and semantic models of architectures. The core ...
Frank S. de Boer, Marcello M. Bonsangue, Joost Jac...