Sciweavers

360 search results - page 31 / 72
» Constraint Checking with Partial Information
Sort
View
FOIKS
2008
Springer
13 years 9 months ago
Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
Henning Köhler
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
14 years 2 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
COLING
1990
13 years 8 months ago
Organizing linguistic knowledge for multilingual generation
We propose an architecture for the organisation of linguistic knowledge which allows to (1) separately formulate generalizations for different types of linguistic information, and...
Martin C. Emele, Ulrich Heid, Stefan Momma, R&eacu...
LPNMR
1997
Springer
13 years 11 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
FORMATS
2006
Springer
13 years 11 months ago
Adding Invariants to Event Zone Automata
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
Peter Niebert, Hongyang Qu