4850 search results - page 230 / 970 » Proof and Computation in Geometry |
151
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
164
click to vote
JAIR
2008
15 years 6 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
175
click to vote
CSL
2005
Springer
16 years 4 days ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
173
click to vote
ENTCS
2008
15 years 6 months ago
2008
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
170
click to vote
AI
2000
Springer
15 years 6 months ago
2000
Springer
We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the PLAGIATOR system which proves theorems by mathematic...