Sciweavers

446 search results - page 31 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
AAAI
1990
13 years 8 months ago
Skolem Functions and Equality in Automated Deduction
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
William McCune
MLQ
2007
90views more  MLQ 2007»
13 years 7 months ago
Kripke submodels and universal sentences
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
Ben Ellison, Jonathan Fleischmann, Dan McGinn, Wim...
CADE
1992
Springer
13 years 11 months ago
IMPS: System Description
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
TPHOL
1997
IEEE
13 years 12 months ago
Type Classes and Overloading in Higher-Order Logic
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
Markus Wenzel
JSC
2000
117views more  JSC 2000»
13 years 7 months ago
Goals and Benchmarks for Automated Map Reasoning
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...
Andrea Formisano, Eugenio G. Omodeo, Marco Temperi...