Sciweavers

3446 search results - page 16 / 690
» A Reasoning Algorithm for pD*
Sort
View
CADE
2011
Springer
14 years 7 months ago
Cutting to the Chase Solving Linear Integer Arithmetic
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
Dejan Jovanovic, Leonardo Mendonça de Moura
195
Voted
CAV
2010
Springer
168views Hardware» more  CAV 2010»
15 years 5 months ago
A Dash of Fairness for Compositional Reasoning
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
Ariel Cohen 0002, Kedar S. Namjoshi, Yaniv Sa'ar
176
Voted
SARA
2000
Springer
15 years 11 months ago
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
Eyal Amir, Sheila A. McIlraith
196
Voted
GECCO
2004
Springer
16 years 26 days ago
The Royal Road Not Taken: A Re-examination of the Reasons for GA Failure on R1
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
Brian Howard, John Sheppard
CADE
2006
Springer
16 years 7 months ago
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
Assia Mahboubi