96 search results - page 13 / 20 » Solving the Satisfiability Problem Using Finite Learning Aut... |
APLAS
2003
ACM
13 years 11 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...
DLOG
2004
13 years 9 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...