3228 search results - page 298 / 646 » Computationally Sound Proofs |
119
click to vote
CADE
1992
Springer
15 years 8 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
100
click to vote
CTRS
1990
15 years 8 months ago
1990
A new positive-unit theorem-proving procedure for equational Horn clauses is presented. It uses a term ordering to restrict paxamodulation to potentiallymaximal sides of equations...
105
click to vote
ACL
1994
15 years 5 months ago
1994
We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algor...
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
101
click to vote
JSC
2006
15 years 4 months ago
2006
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...