By Natarajan Shankar (auth.), Alberto Pettorossi (eds.)

This e-book constitutes the completely refereed post-proceedings of the eleventh foreign Workshop on Logic-Based application Synthesis and Transformation, LOPSTR 2001, held in Paphos, Cyprus, in November 2001.
The thirteen revised complete papers awarded including an invited paper have been conscientiously chosen and stronger in the course of rounds of reviewing and revision. The papers are equipped in topical sections on application transformation and equivalence, application verification, application research, software improvement, and software synthesis.

Show description

Read Online or Download Logic Based Program Synthesis and Transformation: 11th International Workshop, LOPSTR 2001 Paphos, Cyprus, November 28–30, 2001 Selected Papers PDF

Best logic books

Statistical Estimation of Epidemiological Risk (Statistics in Practice)

Statistical Estimation of Epidemiological Risk provides insurance of crucial epidemiological indices, and comprises fresh advancements within the field. A useful reference resource for biostatisticians and epidemiologists operating in sickness prevention, because the chapters are self-contained and have a variety of genuine examples.

An Invitation to Formal Reasoning

This paintings introduces the topic of formal common sense in terms of a procedure that's "like syllogistic logic". Its method, like out of date, conventional syllogistic, is a "term logic". The authors' model of good judgment ("term-function logic", TFL) stocks with Aristotle's syllogistic the perception that the logical kinds of statements which are eager about inferences as premises or conclusions may be construed because the results of connecting pairs of phrases by way of a logical copula (functor).

Additional resources for Logic Based Program Synthesis and Transformation: 11th International Workshop, LOPSTR 2001 Paphos, Cyprus, November 28–30, 2001 Selected Papers

Example text

Another point for further research is the use of non-deterministic constructs that are more appropriate for deductive databases, like these proposed in [GPZ01]. Apart from its theoretical interest, the transformation algorithm can be viewed as the basis of new evaluation strategies for a class of moded Datalog programs. It would therefore be interesting to carry out a careful performance comparison with related optimization techniques, which would reveal the strong and weak points of each approach.

Let P be a Choice DatalognS program, D a database and I an interpretation of PD . Then, CPD (I) is defined as follows: CPD (I) = {I ∪ {#p(L, e)} | p, L, e ∈ SI } A Transformation Technique for Datalog Programs 39 Some observations can be made about the CPD operator. The first one is that CPD preserves the previous computed atoms (it does not reject anything). The next thing is that CPD when applied to an interpretation I, chooses exactly one among all the possible p, L, e triples in SI , and returns the atom #p(L, e).

Rondogiannis, and M. Gergatsoulis The language we will be using in the rest of this paper as the target language of the transformation, is DatalognS extended with choice predicates. Notice that for every predicate symbol p (either IDB or EDB) a predicate #p is associated. Definition 3. A Choice DatalognS program is a DatalognS program which may contain choice atoms in the bodies of its clauses. An exposition of the formal semantics of Choice DatalognS is given in the Appendix of the paper. 5 The Transformation Algorithm In this section we provide a formal definition of the transformation algorithm.

Download PDF sample

Rated 4.12 of 5 – based on 38 votes