Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
Common LISP: the language
First-order logic and automated theorem proving
First-order logic and automated theorem proving
An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
CADE-10 Proceedings of the tenth international conference on Automated deduction
Optimizing the clausal normal form transformation
Journal of Automated Reasoning
Removing redundancy from a clause
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming
Methods and calculi for deduction
Handbook of logic in artificial intelligence and logic programming (vol. 1)
Deduction systems based on resolution
Handbook of logic in artificial intelligence and logic programming (vol. 1)
On the efficiency of subsumption algorithms
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Theorem Proving via General Matings
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Logic and Data Bases
A Multi-Agent Approach to First-Order Logic
EPIA '97 Proceedings of the 8th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
On Generating Small Clause Normal Forms
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Dynamic Social Knowledge: A Cognitive Multi-Agent System Cooperation Strategy
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
In the quest of the missing link
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
| Hi-index | 0.00 |
The transformation between conjunctive and disjunctive canonical forms is useful in domains such as theorem proving, function minimization, and knowledge representation. In this paper, we present a concurrent algorithm for this transformation, suitable for first-order logic theories. The proposed algorithm use the holographic relation between these normal forms in order to avoid the generation of noncondensed and subsumed (dual) clauses. We also stress the facts that, in first-order logic, this transformation is asymmetric and that disjunctive normal form, in some special cases, may be not unique, depending on choices about which subsumptions are allowed or not. The algorithm, which is part of a theorem-proving knowledge representation project, has been implemented and tested.