Compositional Semantics for the Procedural Interpretation of Logic

Details Compositional Semantics for the Procedural Interpretation of Logic Compositional Semantics for the Procedural Interpretation of Logic

2006-02-28

arxiv.org/abs/cs/0602098v2

Computer Science

Programming Languages

17 pages; no figures

Scientific paper

Semantics of logic programs has been given by proof theory, model theory and by fixpoint of the immediate-consequence operator. If clausal logic is a programming language, then it should also have a compositional semantics. Compositional semantics for programming languages follows the abstract syntax of programs, composing the meaning of a unit by a mathematical operation on the meanings of its constituent units. The procedural interpretation of logic has only yielded an incomplete abstract syntax for logic programs. We complete it and use the result as basis of a compositional semantics. We present for comparison Tarski's algebraization of first-order predicate logic, which is in substance the compositional semantics for his choice of syntax. We characterize our semantics by equivalence with the immediate-consequence operator.

Affiliated with

Also associated with

No associations

Rating

Compositional Semantics for the Procedural Interpretation of Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compositional Semantics for the Procedural Interpretation of Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compositional Semantics for the Procedural Interpretation of Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-388274