Properties of Input-Consuming Derivations
نویسندگان
چکیده
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing constructs such as delay declarations. We consider the class of nicely-moded programs and queries. We show that for these programs a weak version of the well-known switching lemma holds also for input-consuming derivations. Furthermore, we show that, under suitable conditions, there exists an algebraic characterization of termination of input-consuming derivations.
منابع مشابه
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 ...
متن کاملSemantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed to a fixed selection rule such as the left-to-right one of Prolog. This has applications e.g. in parallel programming. A mechanism to control dynamic scheduling is provided in existing languages in the form of delay declaration...
متن کاملCv of Dr. Jan-georg Smaus 1.1 Logic Programming
Verification of logic programs with dynamic scheduling. My first work in this area was on programs using delay declarations, in particular, proving termination and absence of runtime errors for such programs [5, 6, 1, 28, 33]. I have developed a more abstract view of dynamic scheduling by defining the so-called input-consuming derivations [8, 28, 32, 34]. More powerful termination conditions we...
متن کاملDERIVATIONS OF TENSOR PRODUCT OF SIMPLE C*-ALGEBRAS
In this paper we study the properties of derivations of A B, where A and B are simple separable C*-algebras, and A B is the C*-completion of A B with respect to a C*-norm Yon A B and we will characterize the derivations of A B in terms of the derivations of A and B
متن کاملf-DERIVATIONS AND (f; g)-DERIVATIONS OF MV -ALGEBRAS
Recently, the algebraic theory of MV -algebras is intensively studied. In this paper, we extend the concept of derivation of $MV$-algebras and we give someillustrative examples. Moreover, as a generalization of derivations of $MV$ -algebraswe introduce the notion of $f$-derivations and $(f; g)$-derivations of $MV$-algebras.Also, we investigate some properties of them.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TPLP
دوره 2 شماره
صفحات -
تاریخ انتشار 1999