20 search results - page 4 / 4 » Proof Search Tree and Cut Elimination |
EPIA
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
CP
2007
Springer
13 years 11 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly manag...