1224 search results - page 31 / 245 » Theory decision by decomposition |
CADE
2001
Springer
14 years 10 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
FOSSACS
2005
Springer
14 years 3 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
ENTCS
2007
13 years 9 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
ISCI
2008
13 years 10 months ago
2008
This paper studies the greedy ensemble selection family of algorithms for ensembles of regression models. These algorithms search for the globally best subset of regresmaking loca...
DSD
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper, we propose an approach to the reduction of sizes of Multi-Terminal Binary Decision Diagrams (MTBDDs) [3] by using the copy properties of discrete functions. The und...