Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Trie Based Subsumption and Improving the pi-Trie Algorithm

View through CrossRef
An algorithm that stores the prime implicates of a logical formula in a trie was developed in [Matusiewicz et.al. 2009]. In this paper, an improved version of that pi-trie algorithm is presented. It achieves its speedup primarily by significantly decreasing subsumption testing. Preliminary experiments indicate the new algorithm to be substantially faster and the trie based subsumption tests to be considerably more efficient than the clause by clause approach originally employed.
Title: Trie Based Subsumption and Improving the pi-Trie Algorithm
Description:
An algorithm that stores the prime implicates of a logical formula in a trie was developed in [Matusiewicz et.
al.
2009].
In this paper, an improved version of that pi-trie algorithm is presented.
It achieves its speedup primarily by significantly decreasing subsumption testing.
Preliminary experiments indicate the new algorithm to be substantially faster and the trie based subsumption tests to be considerably more efficient than the clause by clause approach originally employed.

Related Results

Trie-based Output Space Itemset Sampling
Trie-based Output Space Itemset Sampling
Abstract Itemset mining methods are techniques to discover relevant patterns in transactional databases. The first methods, called constrained-based pattern mining, are bas...
Trie-based Output Space Itemset Sampling
Trie-based Output Space Itemset Sampling
Abstract Itemset mining methods are techniques to discover relevant patterns in transactional databases. The first approach, called constrained-based pattern mining, is bas...
An Affective Computing Multilayer Cognitive Architecture for Evolutionary Cognitive Robotics
An Affective Computing Multilayer Cognitive Architecture for Evolutionary Cognitive Robotics
<p>Robots are entering our daily lives from self-driving cars to health-care robots. Historically, pre-programmed robots were vulnerable to changing conditions in daily life,...
Process-Oriented Subsumption Architectures in Swarm Robotic Systems
Process-Oriented Subsumption Architectures in Swarm Robotic Systems
Previous work has demonstrated the feasibility of using process-oriented programming to implement simple subsumption architectures for robot control. However, the utility and scala...
PENDETEKSIAN KESALAHAN KETIK DENGAN DAMERAU-LEVENSHTEIN DISTANCE DAN TRIE
PENDETEKSIAN KESALAHAN KETIK DENGAN DAMERAU-LEVENSHTEIN DISTANCE DAN TRIE
Typographical errors are commonly found in text. Many applications implement a spell checking feature to detect and correct typographical errors. Spell checking requires an algorit...
Trie-join
Trie-join
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has a...
An optimization algorithm for single-molecule fluorescence resonance (smFRET) data processing
An optimization algorithm for single-molecule fluorescence resonance (smFRET) data processing
The single-molecule fluorescence resonance energy transfer (smFRET) technique plays an important role in the development of biophysics. Measuring the changes of the fluorescence in...
Preliminary Development of Subsumption Architecture Control for Automated Guided Vehicle
Preliminary Development of Subsumption Architecture Control for Automated Guided Vehicle
Subsumption control architecture is an control architecture based on parallel system. Input of information of sensors is directly connected through modules in the control system, a...

Back to Top