On definite program answers and least Herbrand models
Logic in Computer Science
2020-02-19 v3
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).
Keywords
Cite
@article{arxiv.1503.03324,
title = {On definite program answers and least Herbrand models},
author = {Włodzimierz Drabent},
journal= {arXiv preprint arXiv:1503.03324},
year = {2020}
}
Comments
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)