Sciweavers

2917 search results - page 12 / 584
» Satisfying Interaction Constraints
Sort
View
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 11 months ago
Interactive query refinement
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the query result. This has applications to the many/few answers problems often faced by da...
Chaitanya Mishra, Nick Koudas
CPAIOR
2008
Springer
13 years 9 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 5 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...
SIGGRAPH
1999
ACM
13 years 11 months ago
A Hierarchical Approach to Interactive Motion Editing for Human-Like Figures
This paper presents a technique for adapting existing motion of a human-like character to have the desired features that are specified by a set of constraints. This problem can b...
Jehee Lee, Sung Yong Shin