The satissability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computer-aided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, co...

The problem of nding meaningful subcircuits in a logic layout appears in many contexts in computer-aided design. Existing techniques rely upon nding exact matchings of subcircuit structure within the layout. These syntactic techniques fail to identify functionally equivalent subcircuits that are diierently implemented, optimized, or otherwise obfuscated. We present a mechanism for identifying f...

The state of the art of today's drawing conversion systems is described. It reveals a cons~derable amount of interactive assistance especially on complex pattern recognition and interpretation tasks. The difficulties and the major problems are picked up and reasons and solution approaches are stated.

In this paper, we explore several extensions to surface pasting. In particular, using the task of modelling a ferret as a driving force, we improved the user interface for cylindrical pasting; we looked at methods for reducing the distortion of pasted features; and we created a method for pasting trimmed features to allow for features that do not have the rectilinear shape of standard pasting.