Abstract | ||
---|---|---|
In this paper, we study an upside-down transformation of a branch in SOL/Connection tableaux and show that SOL/Connection tableaux using the folding-up operation can always accomplish a size-preserving transformation for any branch in any tableau. This fact solves the exponentially-growing size problem caused both by the order- preserving reduction and by an incremental answer computation problem. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/11560647_11 | ICTAC |
Keywords | Field | DocType |
connection tableau,incremental answer computation problem,upside-down transformation,size-preserving transformation,exponentially-growing size problem,folding-up operation | Model elimination,Discrete mathematics,Computer science,Ramification (botany),Calculus,Computation,Branching (version control) | Conference |
Volume | ISSN | ISBN |
3722 | 0302-9743 | 3-540-29107-5 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Koji Iwanuma | 1 | 138 | 17.65 |
Katsumi Inoue | 2 | 1271 | 112.78 |
Hidetomo Nabeshima | 3 | 154 | 14.88 |