This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem prov...
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...