Prime implicates for approximate reasoning

  • Authors:

  • David Rajaratnam;Maurice Pagnucco

  • Affiliations:

  • National ICT Australia and University of New South Wales, Sydney, Australia;National ICT Australia and University of New South Wales, Sydney, Australia

  • Venue:
  • KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Techniques for improving the computational efficiency of inference have held a long fascination in computer science. Two popular methods include approximate logics and knowledge compilation. In this paper we apply the idea of approximate compilation to develop a notion of prime implicates for the family of classically sound, but incomplete, approximate logics S-3. These logics allow for differing levels of approximation by varying membership of a set of propositional atoms. We present a method for computing the prime S-3-implicates of a clausal knowledge base and empirical results on the behaviour of prime S-3-implicates over randomly generated 3-SAT problems. A very important property of S- 3-implicates and our algorithm for computing them is that decreasing the level of approximation can be achieved in an incremental manner without re-computing from scratch (Theorem 7).