120 search results - page 13 / 24 » Covered Clause Elimination |
CADE
1998
Springer
15 years 1 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
107
click to vote
UAI
1997
14 years 11 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
169
Voted
VLDB
2008
ACM
15 years 9 months ago
2008
ACM
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas 1 and 2 and a mapping over schemas 2 and 3, the composition problem is...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...