183 search results - page 20 / 37 » Automated theorem proving by resolution in non-classical log... |
150
click to vote
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
Gandalf is a first-order resolution theorem-prover, optimized for speed and specializing in manipulations of large clauses. In this paper I describe GANDALF TAC, a HOL tactic that ...
192
click to vote
ICAIL
2003
ACM
15 years 12 months ago
2003
ACM
This paper proposes a logic-oriented framework for institutional agents specification and analysis. Within this framework institutional agents are seen as artificial agents that a...
194
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
142
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
141
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...