1224 search results - page 35 / 245 » Theory decision by decomposition |
102
click to vote
RSCTC
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...
130
Voted
CADE
2012
Springer
13 years 3 months ago
2012
Springer
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
102
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper considers the decomposition of a complex matrix as the product of several sets of semi-unitary matrices and upper triangular matrices in iterative manner. The inner mos...
119
click to vote
PODS
2007
ACM
16 years 27 days ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
103
Voted
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...