An effective bottom-up semantics for first-order linear logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2024, Issue , 2001, Pages 138-152

  Bozzano, Marco ^a   Delzanno, Giorgio ^a   Martelli, Maurizio ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONAL PROGRAMMING; LINEAR ALGEBRA; LOGIC PROGRAMMING; MODEL CHECKING; PETRI NETS; RECONFIGURABLE HARDWARE; SEMANTICS;

ALGORITHMIC TECHNIQUES; BOTTOM-UP EVALUATIONS; FIX-POINT SEMANTICS; LINEAR LOGIC PROGRAMMING; OPERATIONAL ASPECTS; SYMBOLIC MODEL CHECKING; TOP DOWN APPROACHES; VERIFICATION PROBLEMS;

COMPUTER CIRCUITS;

EID: 23044522839     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44716-4_9     Document Type: Conference Paper

References (24)

1. P. A. Abdulla, K. Cerans, B. Jonsson and Y.-K. Tsay. General Decidability Theorems for Infinite-State Systems. In Proc. of LICS 96, pages 313-321, 1996.
2. P. A. Abdulla, and B. Jonsson. Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems. To appear in Theoretical Computer Science, 1999.
3. P. A. Abdulla, and A. Nylen. Better is Better than Well: On EÆcient Verification of Infinite-State Systems. In Proc. LICS’2000, pages 132-140, 2000.
4. J. M. Andreoli. Logic Programming with Focusing proofs in Linear Logic. Journal of Logic and Computation, 2(3):297-347, 1992.
5. J. M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-In Inheritance. In Proc. of ICLP’90, pages 495-510, 1990.
6. J. M. Andreoli, R. Pareschi and T. Castagnetti. Abstract Interpretation of Linear Logic Programming. In Proc. of ILPS’93, pages 295-314, 1993.
7. M. Bozzano, G. Delzanno, and M. Martelli. A Bottom-up semantics for Linear Logic Programs. In Proc. of PPDP 2000, pages 92-102, 2000.
8. M. Bozzano, G. Delzanno, and M. Martelli. An Effective Bottom-Up Se- mantics for First-Order Linear Logic Programs and its Relationship with Decidability Results for Timed Petri Nets. Technical Report, DISI, Uni- versità di Genova, Decemeber 2000.
9. I. Cervesato. Petri Nets and Linear Logic: a Case Study for Logic Programming. In Proc. of GULP-PRODE’95, pages 313-318, 1995.
10. G. Delzanno and A. Podelski. Model Checking in CLP. In Proc. of TACAS’99, LNCS 1579, pages 223-239, 1999.
11. M. Falaschi and G. Levi and M. Martelli and C. Palamidessi. A Model- Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation, 102(1):86-113, 1993.
12. A. Finkel and P. Schnoebelen.: Well-structured Transition Systems Everywhere! Technical Report LSV-98-4, Laboratoire Spècification et Vèrification, ENS Cachan, 1998. To appear in Theoretical Computer Sci- ence, 1999.
13. L. Fribourg. Constraint logic programming applied to model checking. In Proc. LOPSTR’99, pages 31-42, 2000.
14. M. Gabbrielli, M. G. Dore and G. Levi. Observable Semantics for Con- straint Logic Programs. Journal of Logic and Computation, 5(2): 133-171, 1995.
15. J. Y. Girard. Linear Logic. Theoretical Computer Science, 50:1-102, 1987.
16. J. S. Hodas and D. Miller. Logic Programming in a Fragment of Intuition- istic Linear Logic. Information and Computation, 110(2):327-365, 1994.
17. J. Harland and M. Winikoff. Making Logic Programs Reactive. In Proc. of JICSLP’98 Workshop Dynamics’98, pages 43-58, 1998.
18. J. Jaffar and M. J. Maher.: Constraint Logic Programming: A Survey. Journal of Logic Programming, 19-20:503-582, 1994.
19. M. I. Kanovich, Petri Nets, Horn Programs, Linear Logic, and Vector Games. In Proc TACS. ‘94, pages 642-666, 1994.
20. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, E. Shahar. Symbolic Model Checking with Rich Assertional Languages. In Proc. CAV ‘97, pages 424-435, 1997.
21. A. P. Kopylov. Propositional Linear Logic with Weakening is Decidable. In Proc. LICS 95, pages 496-504, 1995.
22. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
23. N. Martì-Oliet, J. Meseguer. From Petri Nets to Linear Logic. Mathemat- ical Structures in Computer Science 1(1):69-101, 1991.
24. D. Miller. Forum: A Multiple-Conclusion Specification Logic. Theoretical Computer Science, 165(1):201-232, 1996.