6978 search results - page 219 / 1396 » On Proofs in System P |
167
click to vote
CSL
2007
Springer
16 years 23 days ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
142
click to vote
LICS
2006
IEEE
16 years 18 days ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
170
click to vote
LPAR
2005
Springer
16 years 2 days ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
156
click to vote
AAAI
1990
15 years 7 months ago
1990
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
204
click to vote
LISP
2008
15 years 6 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...