1818 search results - page 97 / 364 » Granularity-Adaptive Proof Presentation |
CTRS
1990
14 years 1 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...
STOC
1989
ACM
14 years 29 days ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
CTRSA
2006
Springer
14 years 18 days ago
2006
Springer
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
ACL
1994
13 years 10 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
2010
Springer
13 years 9 months ago
2010
Springer
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style exte...