Sciweavers

1435 search results - page 99 / 287
» E-connections of Description Logics
Sort
View
LICS
1999
IEEE
15 years 5 months 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
15 years 2 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
15 years 5 months 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
15 years 5 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...
LOGCOM
2002
142views more  LOGCOM 2002»
15 years 28 days ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke