On definite program answers and least Herbrand models
arXiv:1503.03324 · doi:10.1017/S1471068416000089
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).
11 pages. This version - small changes, version 2 - technical core of the paper corrected, simplified and improved. To appear in Theory and Practice of Logic Programming (TPLP)