We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
Abstract. Configurations of dynamic points in multiple views are interesting to study. In this paper, we present several view and timeindependent constraints on different configura...
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
We present a tool which helps domain experts capture and maintain constraints. The tool displays parts of an ontology (as classes, sub-classes and properties) in the form of a tree...
Suraj Ajit, Derek H. Sleeman, David W. Fowler, Dav...