Artificial Intelligence
Artificial Intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Introduction to Logic and Switching Theory
Introduction to Logic and Switching Theory
A New Algorithm for Generating Prime Implicants
IEEE Transactions on Computers
A Method for Generating Prime Implicants of a Boolean Expression
IEEE Transactions on Computers
A New Technique for the Fast Minimization of Switching Functions
IEEE Transactions on Computers
Completeness theorems for semantic resolution in consequence-finding
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Found ations of assumption-based truth maintenance systems: preliminary report
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Fast Subsumption Checks Using Anti-Links
Journal of Automated Reasoning
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates
Journal of Automated Reasoning
An Efficient Algorithm to Generate Prime Implicants
Journal of Automated Reasoning
An Algorithm for Dual Transformation in First-Order Logic
Journal of Automated Reasoning
A Proof Strategy Based on a Dual Representation
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
A New Algebraic Tool for Automatic Theorem Provers
Annals of Mathematics and Artificial Intelligence
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
An algorithm for computing theory prime implicates in first order logic
International Journal of Information and Communication Technology
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Updating Reduced Implicate Tries
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Prime Implicates and Reduced Implicate Tries
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
A new algorithm for incremental prime implicate generation
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An inference rule for hypothesis generation
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Consequence-finding based on ordered linear resolution
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Prime implicates for approximate reasoning
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Implementing iterated belief change via prime implicates
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Compiling all possible conflicts of a CSP
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Identifying Prime Implicate Branches in Reduced Implicate Tries
Fundamenta Informaticae - Methodologies for Intelligent Systems
The common order-theoretic structure of version spaces and ATMS's
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
An improved incremental algorithm for generating prime implicates
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Prime forms and minimal change in propositional belief bases
Annals of Mathematics and Artificial Intelligence
Tri-based set operations and selective computation of prime implicates
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
A syntactical approach to belief update
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Knowledge compilation for belief change
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Efficient synthesis of feature models
Proceedings of the 16th International Software Product Line Conference - Volume 1
DNF hypotheses in explanatory induction
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
An approach to abductive reasoning in equational logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Given the recent investigation of Clause Management Systems (CMSs) for ArtificialIntelligence applications, there is an urgent need for an efficient incremental method for generating prime implicants. Given a set of clauses F, a set of prime implicants II of F and a clause C"1 the problem can be formulated as finding the set of prime implicants for II U {C}. Intuitively, the property of implicants, being prime implies that any effort to generate prime implicants from a set of prime implicants will not yield any new prime implicants but themselves. In this paper, we exploit the properties of prime implicants and propose an incremental method for generating prime implicants from a set of existing prime implicants plus a new clause. The correctness proof and complexity analysis of the incremental method are presented, and the intricacy of subsumptions in the incremental method is also examined. Additionally, the role of prime implicants in the CMS is also mentioned.