Anytime clausal reasoning

@article{Dalal1998AnytimeCR,
  title={Anytime clausal reasoning},
  author={Mukesh Dalal},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={1998},
  volume={22},
  pages={297-318}
}
Given any incomplete clausal propositional reasoner satisfying certain properties, we extend it to a family of increasingly‐complete, sound, and tractable reasoners. Our technique for generating these reasoners is based on restricting the length of the clauses used in chaining (Modus Ponens). Such a family of reasoners constitutes an anytime reasoner, since each propositional theory has a complete reasoner in the family. We provide an alternative characterization, based on a fixed‐point… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES