846 search results - page 46 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
147
click to vote
FUIN
2000
15 years 6 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
173
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
161
click to vote
LPNMR
2005
Springer
16 years 8 days ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
210
click to vote
RECOMB
2007
Springer
16 years 7 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
188
click to vote
CSR
2008
Springer
15 years 6 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...