Sciweavers

279 search results - page 25 / 56
» Constructive Interval Disjunction
Sort
View
107
Voted
CAV
2010
Springer
198views Hardware» more  CAV 2010»
15 years 7 months ago
Termination Analysis with Compositional Transition Invariants
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...
128
Voted
AAAI
2008
15 years 6 months ago
A Reductive Semantics for Counting and Choice in Answer Set Programming
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
Joohyung Lee, Vladimir Lifschitz, Ravi Palla
118
Voted
JMLR
2002
89views more  JMLR 2002»
15 years 3 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
137
Voted
CONCUR
2010
Springer
15 years 2 months ago
On the Use of Non-deterministic Automata for Presburger Arithmetic
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
Antoine Durand-Gasselin, Peter Habermehl
124
Voted
ESM
2000
15 years 5 months ago
An analysis of the LRE-Algorithm using Sojourn times
The classical method of evaluation of simulations surely is the batch means method, see e.g. [Bratley et al. 1987], giving confidence intervals to express the precision of the sim...
Norbert Th. Müller