6 search results - page 1 / 2 » Complete Integer Decision Procedures as Derived Rules in HOL |
TPHOL
2003
IEEE
13 years 10 months ago
2003
IEEE
CADE
2004
Springer
14 years 5 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Scoring rules for eliciting expert predictions of random variables are usually developed assuming that experts derive utility only from the quality of their predictions (e.g., sco...
ENTCS
2010
13 years 4 months ago
2010
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...