Title

General Model Theoretic Semantics for Higher-Order Horn Logic Programming

Author(s)/Creator(s)

Mino Bai
Howard A. Blair, Syracuse University, School of Computer and Information ScienceFollow

Document Type

Report

Date

5-1992

Keywords

logic programming

Language

English

Disciplines

Computer Sciences

Description/Abstract

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 program P, we need a fixed domain without regard to interpretation which is usually taken to be a set of atomic propositions. We build a semantics where we can fix a domain while changing interpretations. We also develop a fixpoint semantics based on our model, and show that we can get the least fixpoint which is the least model. Using this fixpoint we prove the completeness of the interpreter of our language in [14].

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-92-09

Authors later published: Bai, M., & Blair, H. A. (1992). General model theoretic semantics for Higher-Order horn logic programming (pp. 320-331). Springer-Verlag. doi:10.1007/BFb0013072

Recommended Citation

Bai, Mino and Blair, Howard A., "General Model Theoretic Semantics for Higher-Order Horn Logic Programming" (1992). Electrical Engineering and Computer Science - Technical Reports. 173.
https://surface.syr.edu/eecs_techreports/173

Source

local