On definite program answers and least Herbrand models

DOI10.1017/S1471068416000089zbMath1379.68056arXiv1503.03324OpenAlexW1903998333MaRDI QIDQ4593038

Włodzimierz Drabent

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.03324

zbMATH Keywords

logic programmingfunction symbolsdeclarative semanticsleast Herbrand model

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (3)

Correctness and Completeness of Logic Programs ⋮ Logic + control: On program construction and verification ⋮ Proving completeness of logic programs with the cut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• S-semantics for logic programming: a retrospective look
• Inductive assertion method for logic pograms
• Correctness and Completeness of Logic Programs
• Transforming floundering into success
• Logic and structure

This page was built for publication: On definite program answers and least Herbrand models