On definite program answers and least Herbrand models
W{\l}odzimierz Drabent
TL;DR
This paper establishes a precise condition under which the least Herbrand models of definite clause programs accurately represent their program answers, enhancing understanding of logic programming semantics.
Contribution
It provides a necessary and sufficient condition for least Herbrand models to exactly characterize answers of definite clause programs.
Findings
Identifies the exact condition for least Herbrand models to match program answers
Clarifies the relationship between Herbrand models and program semantics
Contributes to the theoretical foundations of logic programming
Abstract
A sufficient and necessary condition is given under which least Herbrand models exactly characterize the answers of definite clause programs. To appear in Theory and Practice of Logic Programming (TPLP).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.