117
click to vote
CADE
2015
Springer
9 years 11 months ago
2015
Springer
Proving complex problems requires user interaction during proof construction. A major prerequisite for user interaction is that the user is able to understand the proof state in or...
109
click to vote
CADE
2015
Springer
9 years 11 months ago
2015
Springer
An effective SAT preprocessing technique is the addition of symmetry-breaking predicates: auxiliary clauses that guide a SAT solver away from needless exploration of isomorphic su...
101
click to vote
CADE
2015
Springer
9 years 11 months ago
2015
Springer
SMTtoTPTP is a converter from proof problems written in the SMT-LIB format into the TPTP TFF format. The SMT-LIB format supports polymorphic sorts and frequently used theories like...
103
click to vote
CADE
2015
Springer
9 years 11 months ago
2015
Springer
Abstract. We present an approach to component-based program synthesis that uses two distinct interpretations for the symbols in the program. The first interpretation defines the ...
108
click to vote
CADE
2015
Springer
9 years 11 months ago
2015
Springer
We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., “xn ∈ Q” and “xn ∈ Z.” Our decision procedure combines ...