851 search results - page 31 / 171 » Inaccessibility in Decision Procedures |
PLDI
2010
ACM
14 years 5 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our appr...
CADE
2010
Springer
13 years 5 months ago
2010
Springer
x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision pro...
IANDC
2008
13 years 7 months ago
2008
We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...