Declarative Semantics of Input Consuming Logic Programs
نویسندگان
چکیده
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been introduced to describe dynamic scheduling while abstracting from the technical details. In this paper we review and compare the different proposals given in [?], [?] and [?] for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.
منابع مشابه
Semantics of Input-Consuming Logic Programs
Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. In this paper we show that – under some sy...
متن کاملStable Generated Models of Generalized Constraint Logic Programs
We present a declarative semantics of generalized constraint logic programs based on stable generated models. Generalized logic programs contain arbitrary quantiier free formulas in the bodies and heads of their rules. Up to now the only declarative semantics for this program class is deened in terms of stable generated models introduced by Herre and Wagner. A generalized constraint logic progr...
متن کامل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 ...
متن کاملAn Embedding of Input-Output Logic in Deontic Logic Programs
Parametrized logic programs, for which a syntax and natural declarative semantics have been recently defined, are very expressive logic programs under the stable model semantics (also usually called answer set programs) in which complex formulas of a given parameter logic are allowed to appear in the body and head of rules. The choice of the parameter logic depends largely on the domain of the ...
متن کاملDeclarative and Operational Semantics for Bilattice-based Annotated Logic Programs
We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. Thus, we discuss properties of the associated immediate consequence operators and establish their fixed-point theory. In addition, SLD-resolution for these programs is defined and its soundness and completeness established.
متن کامل