An algorithm for computing theory prime implicates in first order logic Online publication date: Thu, 19-Apr-2007
by Arindama Singh, Manoj K. Raut
International Journal of Information and Communication Technology (IJICT), Vol. 1, No. 1, 2007
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.
Online publication date: Thu, 19-Apr-2007
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com