1743 search results - page 82 / 349 » Generalized Modal Satisfiability |
115
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of reconstructing a discrete-time continuous-amplitude signal corrupted by a known memoryless channel with a general output alphabet. We develop a sequence ...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
167
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
141
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
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...
155
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...