Compositional Semantics for the Procedural Interpretation of Logic

نویسنده

  • M. H. van Emden
چکیده

The composition of logic programs out of clauses has been studied semantically, but not the composition of a single clause out of its components. Structurally, a logic program can be regarded as a sentence in clausal form. In his procedural interpretation of logic programs, Kowalski has shown that a positive Horn clause can be viewed as a procedure in the programming sense. This interpretation suggests a composition operator for logic programs, the one where a clause results from composing a head with a body. In this paper we give more detail to the procedural interpretation by giving an algebraic characterization of Kowalski’s composition. In addition, we give algebraic characterizations of the composition of goals in a procedure body and for the composition of the predicate symbol with the argument tuple within a goal. A starting point for the semantic operator corresponding to composition of goals is provided by Tarski’s cylindric algebra semantics for first-order predicate logic. Tarski’s construction is briefly reviewed and suitably modified. The additional semantic operators are shown to be correct with respect to the fixpoint semantics of the logic program as a whole.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Declarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey

One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...

متن کامل

Compositional Semantics for a Language of Imperfect Information

We describe a logic which is the same as first-order logic except that it allows control over the information that passes down from formulas to subformulas. For example the logic is adequate to express branching quantifiers. We describe a compositional semantics for this logic; in particular this gives a compositional meaning to formulas of the ‘information-friendly’ language of Hintikka and Sa...

متن کامل

On the Semantics of Logic Program Composition

This paper aims at offering an insightful synthesis of different compositional semantics for logic program composition which have been developed in the literature. In particular, we will analyse the notions of program equivalence, compositionality, and full abstraction for logic programs. We will show how the notion of supported interpretation provides a unifying compositional model-theoretic c...

متن کامل

A Compositional Semantics of Temporal Expressions in English

This paper describes a compositional semantics for temporal expressions as part of the meaning representation language (MRL) of the JANUS system, a natural language understanding and generation system under joint development by BBN Laboratoires and the Information Sciences Institute. 1 The analysis is based on a higher order intansional logic described in detail in Hinrichs, Ayuso and Scha (198...

متن کامل

A Compositional Semantics for Conditional Term Rewriting Systems

This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context, an equational logic program is viewed as consisting of a set of modules, each module defining a part of the program’s functions. We define a compositional semantics for conditional term rewriting systems which we show...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006