59 search results - page 4 / 12 » A Pushing-Pulling Method: New Proofs of Intersection Theorem... |
197
click to vote
IJCAI
2003
15 years 7 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
174
click to vote
FOCS
2006
IEEE
16 years 21 hour ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
145
click to vote
ITP
2010
15 years 10 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
115
click to vote
MLQ
1998
15 years 5 months ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
139
click to vote
CSL
1994
Springer
15 years 10 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...