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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Iwanuma, K., Inoue, K., & Nabeshima, H. (2005). Upside-down transformation in SOL/connection tableaux and its application. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3722 LNCS, pp. 166–179). https://doi.org/10.1007/11560647_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
