CADE
2010
Springer
13 years 8 months ago
2010
Springer
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating proofs) can be used for a number of applications, such a...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system ...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity i...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...