Sciweavers

1322 search results - page 5 / 265
» Unsound Theorem Proving
Sort
View
AMAI
2007
Springer
13 years 7 months ago
Automated theorem proving by resolution in non-classical logics
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...
Viorica Sofronie-Stokkermans
IANDC
1998
72views more  IANDC 1998»
13 years 7 months ago
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis
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 ...
Maria Paola Bonacina, Jieh Hsiang
CADE
2007
Springer
14 years 1 months ago
Semantic Selection of Premisses for Automated Theorem Proving
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...
Petr Pudlak
IJCAI
2003
13 years 8 months ago
Practical Partition-Based Theorem Proving for Large Knowledge Bases
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...
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
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...
Tobias Schmidt-Samoa