183 search results - page 17 / 37 » Automated theorem proving by resolution in non-classical log... |
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
CADE
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
CADE
2006
Springer
16 years 1 days ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
DAC
2003
ACM
16 years 21 days ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
118
click to vote
ASE
2005
14 years 11 months ago
2005
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...