Please use this identifier to cite or link to this item: http://hdl.handle.net/11717/9074
Title: An algorithm for computing theory prime implicates in first order logic
Authors: Singh, A.
Raut, M.K.
Keywords: Formal logic
Knowledge based systems
Optical resolving power
Computing theory
Consensus methods
First order logic
First-order formulas
Knowledge base
Knowledge compilation
Partial correctness
Theory prime implicates
Algorithms
Issue Date: 2007
Publisher: Inderscience Enterprises Ltd
Citation: International Journal of Information and Communication Technology, 1(1), 4-13
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. Copyright � 2007 Inderscience Enterprises Ltd.
URI: http://dx.doi.org/10.1504/IJICT.2007.013273
http://hdl.handle.net/11717/9074
ISSN: 14666642
Appears in Collections:Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.