844 search results - page 66 / 169 » Safraless Decision Procedures |
CAV
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
CSL
2007
Springer
13 years 8 months ago
2007
Springer
This study is aimed at investigating whether automatic phonetic transcription procedures can approximate manual transcriptions typically delivered with contemporary large speech c...
EMO
2009
Springer
14 years 3 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
LICS
1991
IEEE
14 years 8 days ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
ICML
1994
IEEE
14 years 8 days ago
1994
IEEE
We explore algorithms for learning classification procedures that attempt to minimize the cost of misclassifying examples. First, we consider inductive learning of classification ...