Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic

@article{Komendantskaya2015StructuralRA,
  title={Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic},
  author={Ekaterina Komendantskaya and Patricia Johann},
  journal={CoRR},
  year={2015},
  volume={abs/1511.07865}
}
Logic programming (LP) is a programming language based on fir st-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are ind uctively sound and complete with respect to least Herbrand m o els of logic programs. Dually, the corecursive approach to S LD-resolution views infinite SLD-computations as successi vely approximating infinite terms contained in programs’ greate st complete Herbrand models. State-of-the-art algorithms implementing… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 15 references

A Coinductive Frame

  • ew Polonsky, Alexandra Silva
  • 2015

Idealized coindu

  • Davide Ancona, Giobanni Lagorio
  • 2011
2 Excerpts

Productivity of strea

  • ya Isihara, Jan Willem Klop
  • 2010

Productivity of stream definitions

  • Andrew Polonsky
  • Theoretical Computer Science
  • 2010

Similar Papers

Loading similar papers…