• Publications
  • Influence
Extracting frequent subsequences from a single long data sequence a novel anti-monotonic measure and a simple on-line algorithm
tl;dr
We propose a novel frequency measure, called the total frequency, for counting multiple occurrences of a sequential pattern in a single data sequence. Expand
  • 22
  • 6
Speculative computation by abduction under incomplete communication environments
tl;dr
We present a method of problem solving in multi-agent systems when communication between agents is not guaranteed. Expand
  • 51
  • 5
SOLAR: An automated deduction system for consequence finding
tl;dr
SOLAR is a first-order clausal consequence finding system based on the SOL (Skip Ordered Linear) tableau calculus. Expand
  • 49
  • 3
  • Open Access
SOLAR: A Consequence Finding System for Advanced Reasoning
tl;dr
SOLAR is an efficient first-order consequence finding system based on a connection tableau format with Skip operation that can avoid producing non-minimal/redundant consequences. Expand
  • 41
  • 2
On anti-monotone frequency measures for extracting sequential patterns from a single very-long data sequence
tl;dr
We propose a novel frequency measure, called the total frequency, for counting multiple occurrences of a sequential pattern in a very-long single data sequence. Expand
  • 22
  • 2
Lemma Reusing for SAT based Planning and Scheduling
tl;dr
We propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Expand
  • 22
  • 2
  • Open Access
Minimal Answer Computation and SOL
tl;dr
We study minimal and/or conditional answer computing and its related problems and show that SOL is complete for computing not only correct answers, but also minimal answers. Expand
  • 21
  • 1
Completeness of Pruning Methods for Consequence Finding Procedure SOL
In this paper, we study the completeness of several types of pruning methods for the logical consequence nding procedure SOL-resolution. The consequence nd-ing problem is a generalization of theExpand
  • 21
  • 1
  • Open Access
Lemma Matching for a PTTP-based Top-down Theorem Prover
tl;dr
We study the efficiency and limitation of various forms of lemma matching, which is intended to speed up top-down theorem proving, and compare them with OTTER and SETHEO. Expand
  • 13
  • 1
An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection
tl;dr
We propose a new on-line e-approximation algorithm for mining closed itemsets from a transactional data stream, which is also based on the incremental/cumulative intersection principle. Expand
  • 8
  • 1
  • Open Access