Apt, K., Marchiori, E., and Palamidessi, C. (1992). A Theory of FirstOrder Built-in's of Prolog. In Kirchner, H. and Levi, G., editors, Proc. of the Third Int. Conference on Algebraic and Logic Programming (ALP), volume 632 of Lecture Notes in Computer Science, pages 69--83. SpringerVerlag. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Analysis of pure PROLOG programs - Levi, Micciancio (1995) (1 citation) (Correct)
....to full PROLOG, with the aim of making the existing analyses useful in real PROLOG compilers. Lower approximations and the information our semantics has about termination make it feasible the extension to cut, negation as failure and setof. First order built in s might be modeled as suggested in [1]. ....
K. R. Apt, E. Marchiori, and C. Palamidessi. A theory of first-order built-in's of PROLOG. In H. Kirchner and G. Levi, editors, Algebraic and Logic Programming, Proceedings of the Third International Conference, volume 632 of Lecture Notes in Computer Science, pages 69--83. Springer-Verlag, Berlin, 1992.
From Concurrent Logic Programming to Concurrent Constraint .. - de Boer, Palamidessi (1993) (6 citations) Self-citation (Palamidessi) (Correct)
No context found.
Apt, K., Marchiori, E., and Palamidessi, C. (1992). A Theory of FirstOrder Built-in's of Prolog. In Kirchner, H. and Levi, G., editors, Proc. of the Third Int. Conference on Algebraic and Logic Programming (ALP), volume 632 of Lecture Notes in Computer Science, pages 69--83. SpringerVerlag.
A Declarative Approach for First-Order Built-in's of Prolog - Apt, Marchiori, Palamidessi (1992) (4 citations) Self-citation (Apt Marchiori Palamidessi) (Correct)
....supported by ESPRIT Basic Research Action 3020 and by the Italian CNR (Consiglio Nazionale delle Ricerche) The work of E. Marchiori was partly supported by ESPRIT Basic Research Action 6810 (Compulog 2) and by the Italian CNR under Grant No. 89.00026.69. A short version of this paper appeared as [AMP92]. 1 Introduction 1.1 Motivation Theory of logic programming allows us to treat formally only pure Prolog programs, that is those whose syntax is based on Horn clauses. Any formal treatment of more realistic Prolog programs 1 has to take into account the use of various built in s. Some of them, ....
K.R. Apt, E. Marchiori, and C. Palamidessi. A theory of first order built-in's of Prolog. Res. Report CS-R9216, CWI, Amsterdam, 1992.
From Concurrent Logic Programming to Concurrent Constraint .. - de Boer, Palamidessi (1993) (6 citations) Self-citation (Palamidessi) (Correct)
No context found.
Apt, K., Marchiori, E., and Palamidessi, C. (1992). A Theory of FirstOrder Built-in's of Prolog. In Kirchner, H. and Levi, G., editors, Proc. of the Third Int. Conference on Algebraic and Logic Programming (ALP), volume 632 of Lecture Notes in Computer Science, pages 69--83. SpringerVerlag.
Combining Logic and Control to Characterize Global.. - Colussi.. (1994) Self-citation (Marchiori) (Correct)
....and to the operator [ Then an approximation O a of O is obtained by iterating O(k) a from k = 0 until a fixpoint is reached. Related work Various alternative semantics for logic programming languages have been given. Non standard declarative semantics have been introduced in [FLMP89] and [AMP92], the first to fill the gap between declarative and operational semantics of logic programs, the second to deal also with some metalogical, built in relations. Our contribution is related to those approaches which employ mathematical concepts and techniques traditionally applied in the imperative ....
....occur. 3 Predicate Transformer Semantics of Built in s We consider here the built in s of Prolog that include the arithmetic relations like , and some metalogical relations like var and nonvar. The semantics of a logic program is influenced by the presence of such predefined relations (see e.g. [AMP92] for an extended discussion on the complications that they cause) However, the meaning of such built in s is independent of the program in which they occur. Therefore we can describe their semantics by means of a (strongest postcondition) predicate transformer sp, which computes the strongest ....
[Article contains additional citation context not shown here]
K.R. Apt, E. Marchiori, and C. Palamidessi. A theory of first order built-in's of Prolog. Report CS-R9216, CWI, Amsterdam, 1992.
Reasoning about Termination of Pure Prolog Programs - Apt, Pedreschi (1993) (102 citations) Self-citation (Apt) (Correct)
....and should be avoided instead of being formally analyzed. Other issues, like the use of built in s considerably complicate the matters and call for new insights. Termination of programs that use first order built in s (so var, nonvar, ground etc. is studied in Apt, Marchiori and Palamidessi [APM92] where for this purpose a new declarative semantics based on non ground atoms is introduced. Related work Of course the subject of termination of Prolog programs has been studied by others. Without aiming at completeness we mention here the following related work. Vasak and Potter [VP86] ....
K.R. Apt, C. Palamidessi, and E. Marchiori. A theory of first-order built-in's of Prolog. In H. Kirchner and G. Levi, editors, Proceeding of the Third International Conference on Algebraic and Logic Programming (ALP 92), Lecture Notes in Computer Science 632, pages 69--83, Berlin, 1992. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC