A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
General model theoretic semantics for Higher-Order horn logic programming
[chapter]
Logic Programming and Automated Reasoning
We introduce model-theoretic semantics [6] for Higher-Order Horn logic programming language. One advantage of logic programs over conventional non-logic programs has been that the least fixpoint is equal to the least model, therefore it is associated to logical consequence and has a meaningful declarative interpretation. In simple theory of types [9] on which Higher-Order Horn logic programming language is based, domain is dependent on interpretation [10). To define T 'P operator for a logic
doi:10.1007/bfb0013072
dblp:conf/lpar/BaiB92
fatcat:glzrn3dj6ffwxkz67tnuqr4eci