Sciweavers

275 search results - page 30 / 55
» The Complexity of Generalized Satisfiability for Linear Temp...
Sort
View
KI
2006
Springer
13 years 7 months ago
A New n-ary Existential Quantifier in Description Logics
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
EDBT
2006
ACM
202views Database» more  EDBT 2006»
14 years 7 months ago
Bridging Physical and Virtual Worlds: Complex Event Processing for RFID Data Streams
Advances of sensor and RFID technology provide significant new power for humans to sense, understand and manage the world. RFID provides fast data collection with precise identific...
Fusheng Wang, Shaorong Liu, Peiya Liu, Yijian Bai
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 8 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
AI
2005
Springer
13 years 7 months ago
Knowledge updates: Semantics and complexity issues
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
Chitta Baral, Yan Zhang
VMCAI
2010
Springer
14 years 4 months ago
Improved Model Checking of Hierarchical Systems
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
Benjamin Aminof, Orna Kupferman, Aniello Murano