846 search results - page 63 / 170 » Rewrite-Based Decision Procedures |
TARK
2007
Springer
15 years 6 months ago
2007
Springer
The problem of the aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on the same propositions has recently drawn m...
CAV
2004
Springer
15 years 5 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
14 years 12 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...
103
click to vote
EMO
2009
Springer
15 years 6 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
116
click to vote
LICS
1991
IEEE
15 years 3 months 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 ...