242
click to vote
CADE
10 years 29 days ago
2015 Springer 
Abstract. This paper describes two advancements of SAT-based KnuthBendix completion as implemented in Maxcomp. (1) Termination techniques using the dependency pair framework are en...
242
click to vote
CADE
10 years 29 days ago
2015 Springer 
Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system descri...
230
click to vote
CADE
10 years 29 days ago
2015 Springer
Abstract. beluga is a proof environment which provides a sophisticated infrastructure for implementing formal systems based on the logical framework LF together with a first-order...
228
click to vote
CADE
10 years 29 days ago
2015 Springer
Abstract. Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory o...
|
Logical Reasoning