An Incremental Knowledge Compilation in First Order Logic

Details An Incremental Knowledge Compilation in First Order Logic An Incremental Knowledge Compilation in First Order Logic

2011-10-31

arxiv.org/abs/1110.6738v2

Computer Science

Logic in Computer Science

Scientific paper

An algorithm to compute the set of prime implicates of a quantifier-free clausal formula X in first order logic had been presented in earlier work. As the knowledge base X is dynamic, new clauses are added to the old knowledge base. In this paper an incremental algorithm is presented to compute the prime implicates of X and a clause C from $\pi(X)\cup C$. The correctness of the algorithm is also proved.

Affiliated with

Also associated with

No associations

Rating

An Incremental Knowledge Compilation in First Order Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Incremental Knowledge Compilation in First Order Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Incremental Knowledge Compilation in First Order Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147417