# An Incremental Knowledge Compilation in First Order Logic

Source: [An Incremental Knowledge Compilation in First Order Logic](<https://www.sota2.com/research/paper/68fa60691e209131ce9ef13f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:38:40.516Z

Authors: Manoj K. Raut

Published: 2011-10-31T10:16:24.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1110.6738>)

[PDF](<https://arxiv.org/pdf/1110.6738.pdf>)
