90 search results - page 11 / 18 » Automated theorem proving in quasigroup and loop theory |
LPAR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
100
click to vote
CADE
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
111
click to vote
CADE
2009
Springer
16 years 8 days ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
98
Voted
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
143
click to vote
ICLP
2011
Springer
14 years 3 months ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...