183 search results - page 36 / 37 » Automated theorem proving by resolution in non-classical log... |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
122
click to vote
ICSE
2007
IEEE-ACM
15 years 3 months ago
2007
IEEE-ACM
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
113
click to vote
MCMASTER
1993
15 years 1 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
Timed Interval Calculus (TIC) is a highly expressive set-based notation for specifying and reasoning about embedded real-time systems. However, it lacks mechanical proving support...