Sciweavers

811 search results - page 34 / 163
» Refactoring Using Type Constraints
Sort
View
SARA
2009
Springer
14 years 3 months ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...
VLDB
1991
ACM
110views Database» more  VLDB 1991»
14 years 4 days ago
Ode as an Active Database: Constraints and Triggers
The Ode object-oriented database provides facilities for associating conslraims and [riggers with ohjecls. Conslrainls and triggers are associated with class (ohjea type) definiti...
Narain H. Gehani, H. V. Jagadish
FAC
2010
105views more  FAC 2010»
13 years 7 months ago
A formalization of geometric constraint systems and their decomposition
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
Pascal Mathis, Simon E. B. Thierry
CP
2009
Springer
14 years 9 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
ICLP
2005
Springer
14 years 2 months ago
Abduction of Linear Arithmetic Constraints
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
Michael J. Maher