1410 search results - page 10 / 282 » Proving theorems by reuse |
LICS
2003
IEEE
14 years 3 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
TPHOL
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
TPHOL
2000
IEEE
14 years 2 months ago
2000
IEEE
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
PSSS
2003
13 years 11 months ago
2003
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
IGPL
1998
13 years 9 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...