#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Takahisa Toda
- SEA
- 2013

- Yuma Inoue, Takahisa Toda, Shin-ichi Minato
- IEICE Transactions
- 2014

A pattern occurs in a permutation if there is a subsequence of the permutation with the same relative order as the pattern. For mathematical analysis of permutation patterns, strong Wilf-equivalence has been defined as the equivalence between permutation patterns based on the number of occurrences of a pattern. In this paper, we present an algorithm for… (More)

- Takahisa Toda, Koji Tsuda
- SAC
- 2015

We improve an existing OBDD-based method of computing all total satisfying assignments of a Boolean formula, where an OBDD means an ordered binary decision diagram that is not necessarily reduced. To do this, we introduce lazy caching and finer caching by effectively using unit propagation. We implement our methods on top of a modern SAT solver, and show by… (More)

- Takahisa Toda, Takehide Soh
- ACM Journal of Experimental Algorithmics
- 2016

All solutions SAT (AllSAT for short) is a variant of the propositional satisfiability problem. AllSAT has been relatively unexplored compared to other variants despite its significance. We thus survey and discuss major techniques of AllSAT solvers. We accurately implemented them and conducted comprehensive experiments using a large number of instances and… (More)

- Takahisa Toda
- Annals of Mathematics and Artificial Intelligence
- 2014

Dualization of Boolean functions is a fundamental problem that appears in various fields such as artificial intelligence, logic, data mining, etc. For monotone Boolean functions, many empirical researches that focus on practical efficiency have recently been done. We extend our previous work for monotone dualization and present a novel method for… (More)

- Takahisa Toda
- Algorithms
- 2012

A zero-suppressed binary decision diagram (ZDD) is a graph representation suitable for handling sparse set families. Given a ZDD representing a set family, we present an efficient algorithm to discover a hidden structure, called a co-occurrence relation, on the ground set. This computation can be done in time complexity that is related not to the number of… (More)

- Takahisa Toda
- Discovery Science
- 2013

Pattern-avoiding permutations are permutations where none of the subsequences match the relative order of a given pattern. Pattern-avoiding permutations are related to practical and abstract mathematical problems and can provide simple representations for such problems. For example, some floorplans, which are used for optimizing very-large-scale… (More)

- Takahisa Toda, Ivo Vigan
- Discrete Mathematics
- 2013

We focus on families of bipartitions, i.e. set partitions consisting of atmost two components. A family of bipartitions is a separating family for a set if every two elements in the set are separated by some bipartition. In this paper we enumerate separating families of arbitrary size. We furthermore enumerate inclusion-wise minimal separating families of… (More)