Sciweavers

4401 search results - page 367 / 881
» Computing with Default Logic
Sort
View
ICALP
2009
Springer
16 years 7 months ago
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
Pawel Parys, Igor Walukiewicz
PERCOM
2004
ACM
16 years 6 months ago
XML Language Binding Support for Pervasive Communication in Distributed Virtual Shared Information Spaces
In this paper we show a novel middleware approach for pervasise applications that communicate via an XMLbased distributed virtual shared information space. This approach extends s...
Norbert Luttenberger, Florian Reuter, Jochen Kober...
DEXAW
2006
IEEE
126views Database» more  DEXAW 2006»
16 years 24 days ago
Consistent Query Answering: Opportunities and Limitations
This paper briefly reviews the recent literature on consistent query answering, an approach to handle database inconsistency in a systematic and logical manner based on the notio...
Jan Chomicki
AMAI
2004
Springer
16 years 4 days ago
The Expressive Rate of Constraints
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
Hubie Chen
IWPEC
2004
Springer
16 years 2 days ago
On Miniaturized Problems in Parameterized Complexity Theory
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
Yijia Chen, Jörg Flum