2035 search results - page 99 / 407 » On the complexity of stratified logics |
170
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
176
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...
149
click to vote
LPNMR
2005
Springer
15 years 11 months 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 ...
180
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
182
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...