Sciweavers

851 search results - page 55 / 171
» Inaccessibility in Decision Procedures
Sort
View
WSC
1997
13 years 9 months ago
Selecting the Best System: A Decision-Theoretic Approach
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
Stephen E. Chick
POPL
2011
ACM
12 years 10 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
14 years 2 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...
CADE
2012
Springer
11 years 10 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
RTSS
1997
IEEE
13 years 12 months ago
More optimism about real-time distributed commit processing
In [6], we proposed a new commit protocol, OPT, specially designed for use in distributed firm-deadline real-time database systems. OPT allows transactions to “optimistically...
Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritha...