For the development of practical semantic applications, ontologies are commonly used with rule extensions. Prominent examples of semantic applications are Semantic Wikis, Semantic...
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Abstract—The design of integrated circuits involves the consideration of a large number of constraints of various types. In addition to the definition of these constraints in a ...
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...