754 search results - page 44 / 151 » An Ordered Logic Program Solver |
122
Voted
ASP
2005
Springer
15 years 6 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
121
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
97
Voted
CADE
2006
Springer
16 years 27 days ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
CP
2005
Springer
15 years 6 months ago
2005
Springer
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
135
click to vote
FLOPS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...