Abstract: Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms...
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
Telecommunication systems are often specified in the standardized languages SDL and MSc. These languages allow only the specification of pure functional aspects. To remedy this pr...