A New Algorithm for Incremental Prime Implicate Generation
نویسنده
چکیده
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first transformed into a CNF formula. This process, however, requires exponential time in the worst case and can result in an exponential blow up of the input size. Such cases occur frequently when the problem domains are best characterized by some DNF formulas. In this paper, we study a new algorithm which allows a more general input: a conjunction of DNF formulas. We wil l present empirical results comparing the new algorithm with some existing implementations, and discuss how it can be used in a propositional abductive reasoning system.
منابع مشابه
Prime Implicate Generation in Equational Logic
We present an algorithm for the generation of prime implicates in equational logic, that is, of the most general consequences of formulæ containing equations and disequations between first-order terms. This algorithm is defined by a calculus that is proved to be correct and complete. We then focus on the case where the considered clause set is ground, i.e., contains no variables, and devise a s...
متن کاملPrime Implicate Normal Form for ALC Concepts
In this paper, we present a new normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate. We show that concepts in prime implicate normal form enjoy a number of desirable properties which make prime implicate normal form interesting from the viewpoint of knowledge compilation. In particular, we prove that subsumption betw...
متن کاملOptimal Placement of DGs in Distribution System including Different Load Models for Loss Reduction using Genetic Algorithm
Distributed generation (DG) sources are becoming more prominent in distribution systems due to the incremental demands for electrical energy. Locations and capacities of DG sources have great impacts on the system losses in a distribution network. This paper presents a study aimed for optimally determining the size and location of distributed generation units in distribution systems with differ...
متن کاملA Hybrid Framework for Building an Efficient Incremental Intrusion Detection System
In this paper, a boosting-based incremental hybrid intrusion detection system is introduced. This system combines incremental misuse detection and incremental anomaly detection. We use boosting ensemble of weak classifiers to implement misuse intrusion detection system. It can identify new classes types of intrusions that do not exist in the training dataset for incremental misuse detection. As...
متن کاملTwo Compact Incremental Prime Sieves
A prime sieve is an algorithm that finds the primes up to a bound n. We say that a prime sieve is incremental, if it can quickly determine if n+1 is prime after having found all primes up to n. We say a sieve is compact if it uses roughly √ n space or less. In this paper we present two new results: • We describe the rolling sieve, a practical, incremental prime sieve that takes O(n log logn) ti...
متن کامل