The Limits of Horn Logic Programs
<|reference_start|>The Limits of Horn Logic Programs: Given a sequence $\{\Pi_n\}$ of Horn logic programs, the limit $\Pi$ of $\{\Pi_n\}$ is the set of the clauses such that every clause in $\Pi$ belongs to almost every $\Pi_n$ and every clause in infinitely many $\Pi_n$'s belongs to $\Pi$ also. The limit program $\Pi$ is still Horn but may be infinite. In this paper, we consider if the least Herbrand model of the limit of a given Horn logic program sequence $\{\Pi_n\}$ equals the limit of the least Herbrand models of each logic program $\Pi_n$. It is proved that this property is not true in general but holds if Horn logic programs satisfy an assumption which can be syntactically checked and be satisfied by a class of Horn logic programs. Thus, under this assumption we can approach the least Herbrand model of the limit $\Pi$ by the sequence of the least Herbrand models of each finite program $\Pi_n$. We also prove that if a finite Horn logic program satisfies this assumption, then the least Herbrand model of this program is recursive. Finally, by use of the concept of stability from dynamical systems, we prove that this assumption is exactly a sufficient condition to guarantee the stability of fixed points for Horn logic programs.<|reference_end|>
@article{ma2001the,
    title={The Limits of Horn Logic Programs},
    author={Shilong Ma, Yuefei Sui, Ke Xu},
    journal={In P. J. Stuckey (Ed.): Proc. of 18th ICLP (short paper), LNCS
  2401, p. 467, Denmark, 2002.},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0103008},
    primaryClass={cs.LO cs.PL}
}