2015/03/31 by Włodzimierz Drabent
Computer Science · #Automated theorem proving #Calculus (dental) #Computer science #Definite clause grammar #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming language #acm:03B10 #acm:68N17 #cs.LO #msc:03B10 #msc:68N17
paper · pdf · doi:10.1017/s1471068416000089
published as Theory and Practice of Logic Programming 16 (2016) 498-508 · 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)
arxiv created 2016/01/23 · openalex publication_date 2016/05/03 · arxiv updated 2020/02/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Abstract A sufficient and necessary condition is given under which least Herbrand models exactly characterize the answers of definite clause programs.