Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
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...
Philip A. Bernstein, Todd J. Green, Sergey Melnik,...
Scheduling is a key concern for the execution of performancedriven Grid applications. In this paper we comparatively examine different existing approaches for scheduling of scient...
: There has been an abundance of research within the last couple of decades in the area of multilevel secure (MLS) databases. Recent work in this field deals with the processing of...