5550 search results - page 34 / 1110 » Different Approaches to Proof Systems |
TPHOL
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
USS
2008
15 years 12 days ago
2008
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
CIKM
2008
Springer
15 years 2 days ago
2008
Springer
In a corpus of jokes, a human might judge two documents to be the "same joke" even if characters, locations, and other details are varied. A given joke could be retold w...
JAR
2006
14 years 10 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
AI
2000
Springer
14 years 10 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...