The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into acco...
We present a technique for organizing data in spatial databases with non-convex domains based on an automatic characterization using the medial-axis transform (MAT). We define a t...
Eric A. Perlman, Randal C. Burns, Michael M. Kazhd...
is a challenging problem. We consider here abstract specifications consisting of a composition of components and a controller given in the form of a set of interactions and a prior...
Imene Ben Hafaiedh, Susanne Graf, Hammadi Khairall...