Editing The Limits of Horn Logic Programs

Title: The Limits of Horn Logic Programs

Research Question: Can the limits of a sequence of Horn logic programs be related to their least Herbrand models?

Methodology: The researchers studied the limits of sequences of Horn logic programs and considered their Herbrand models. They aimed to prove that the limit of the least Herbrand models of a sequence of logic programs is equal to the least Herbrand model of the limit of the logic programs.

Results: The researchers found that this equality does not always hold. They provided three examples to illustrate this. However, they also proved that under certain assumptions, the equality holds.

Implications: The findings of this research have implications for the field of logic programming and knowledge engineering. The ability to reason about the limits of logic programs can help in understanding how knowledge evolves over time and how to effectively represent and reason with large amounts of information.

The research also suggests that there may be constraints on the logic programs that need to be taken into account to ensure the equality holds. The researchers proposed two ways to avoid imposing these constraints, which are based on the ramified definition of the limits of logic programs.

Overall, this research contributes to the understanding of the limits of Horn logic programs and their relationship with Herbrand models, which has practical implications for the field of logic programming and knowledge engineering.

Link to Article: https://arxiv.org/abs/0103008v2
Authors: 
arXiv ID: 0103008v2

[[Category:Computer Science]]
[[Category:Logic]]
[[Category:Programs]]
[[Category:Limits]]
[[Category:Herbrand]]
[[Category:Horn]]