: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
A great challenge for flow simulators of new generation is to gain more accuracy at well proximity within complex geological structures. For this purpose, a new approach based on...
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...