An algorithm for computing theory prime implicates in first order logic

Authors:
Arindama Singh;Manoj K. Raut
Affiliations:
Department of Mathematics, Indian Institute of Technology Madras, Chennai-600036, India.;School of Computing Sciences, Vellore Institute of Technology, Vellore-632014, India
Venue:
International Journal of Information and Communication Technology
Year:
2007

Citing 9
Cited 0

An assumption-based TMS

Artificial Intelligence
An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
Implicit and incremental computation of primes and essential primes of Boolean functions

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Polynomial-time algorithms for generation of prime implicants

Journal of Complexity
Computing Prime Implicants

Proceedings of the 10th International Conference on Automated Deduction
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers
Knowledge compilation using theory prime implicates

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Approximate knowledge compilation: the first order case

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm based on consensus method to compute the set of prime implicates of a quantifier free first order formula X was presented in an earlier work. In this paper the notion of prime implicates is extended to theory prime implicates in the first order case. We provide an algorithm to compute the theory prime implicates of a knowledge base X with respect to another knowledge base Y where both X and Y are assumed to be unquantified first order formulas. The partial correctness of the algorithm is proved.