90 search results - page 5 / 18 » Automated theorem proving in quasigroup and loop theory |
IPL
2006
13 years 6 months ago
2006
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
DIS
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
LORI
2009
Springer
14 years 1 months ago
2009
Springer
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
NFM
2011
13 years 1 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...