In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
: An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential fo...
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
We introduce a class of coalgebraic models and a family of modal logics that support the specication of spatial properties of distributed applications. The evaluation of a formul...
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...