Sciweavers

639 search results - page 4 / 128
» Dominance Constraints with Set Operators
Sort
View
FROCOS
2009
Springer
14 years 1 months ago
Combining Theories with Shared Set Operations
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
Thomas Wies, Ruzica Piskac, Viktor Kuncak
DGCI
2006
Springer
13 years 9 months ago
Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...
Sara Brunetti, Alain Daurat, Attila Kuba
TAPSOFT
1997
Springer
13 years 11 months ago
Inclusion Constraints over Non-empty Sets of Trees
Abstract. We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 t2 between rst-order terms (without set operators) which are interpreted...
Martin Müller, Joachim Niehren, Andreas Podel...
ICRA
2005
IEEE
127views Robotics» more  ICRA 2005»
14 years 29 days ago
Operational Space Control of Multibody Systems with Explicit Holonomic Constraints
— This paper presents an operational space control approach for the general class of holonomically constrained multibody systems. As a point of departure, the general formulation...
Vincent De Sapio, Oussama Khatib
CP
2010
Springer
13 years 5 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin