Sciweavers

1410 search results - page 58 / 282
» Proving theorems by reuse
Sort
View
AAAI
1997
13 years 11 months ago
Ordered Semantic Hyper Linking
In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational th...
David A. Plaisted, Yunshan Zhu
IWAR
1992
13 years 11 months ago
Automated Reasoning in Differential Geometry and Mechanics Using Characteristic Method
This paper reports the study of properties of the curve pairs of the Bertrand types using our automated reasoning program based on Wu's method of mechanical theorem proving fo...
Shang-Ching Chou, Xiao-Shan Gao
APAL
2004
132views more  APAL 2004»
13 years 9 months ago
Canonical structure in the universe of set theory: part one
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...
James Cummings, Matthew Foreman, Menachem Magidor
LORI
2009
Springer
14 years 4 months ago
First-Order Logic Formalisation of Arrow's Theorem
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
Umberto Grandi, Ulle Endriss
ECCC
2010
92views more  ECCC 2010»
13 years 8 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau