Filters








1,175 Hits in 2.4 sec

Unfolding, procedural and fixpoint semantics of logic programs [chapter]

François Denis, Jean-Paul Delahaye
STACS 91  
and new results of equivalence between procedural and fixpoints semantics of logic programs.  ...  In this paper, we propose new notions related to unfolding semantics which clarify the relationship between procedural and fixpoint semantics of logic programs.  ...  Unfolding and procedural semantics We show in this section that unfolding preserves the procedural semantics of logic programs in a strong sense, i.e. taking finite failure and computed answers into account  ... 
doi:10.1007/bfb0020825 dblp:conf/stacs/DenisD91 fatcat:l6zuv4aiu5hrtn3u2nwyqnkdl4

Page 476 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
This allows the gen- eralization of the s-semantics approach to normal CLP programs, and provides a fixpoint characterization of Kunen’s semantics.  ...  models of a program by fixpoints of this operator.  ... 

Foundations for natural proofs and quantifier instantiation

Christof Löding, P. Madhusudan, Lucas Peña
2017 Proceedings of the ACM on Programming Languages  
Furthermore, we study recursive definitions with least fixpoint semantics and show that though they are not amenable to complete procedures, we can systematically introduce induction principles that in  ...  We develop a framework for first order logic (FOL) over an uninterpreted combination of background theories.  ...  ACKNOWLEDGEMENTS We would like to thank Rupak Majumdar for discussions on complete logics for program verification.  ... 
doi:10.1145/3158098 dblp:journals/pacmpl/LodingMP18 fatcat:u5xnpsg2arbuxovuyvwmkdddoa

Page 6228 of Mathematical Reviews Vol. , Issue 96j [page]

1996 Mathematical Reviews  
to the stable model semantics of logic programs with negation.  ...  Logic Programming 25 (1995), no. 1, 33-51. Summary: “We present a new fixpoint characterization of the min- imal models of disjunctive logic programs.  ... 

Unfolding and fixpoint semantics of concurrent constraint logic programs [chapter]

Maurizio Gabbrielli, Giorgio Levi
1990 Lecture Notes in Computer Science  
Theorem 8. 7 7 (Equivalence of the fixpoint and the unfolding semantics). Let P be u program. Then 'g(P) = 3 (P). Corollary 8.8 (Equivalence of the fixpoint and the operational semantics).  ...  of concurrency and logic programming.  ...  Appendix A In this appendix, we give the proofs of some technical lemmata and theorems concerning the equivalence results for the unfolding and the fixpoint semantics.  ... 
doi:10.1007/3-540-53162-9_40 fatcat:vdwdz56rebgkzkqkembu6fydke

Unfolding and fixpoint semantics of concurrent constraint logic programs

Maurizio Gabbrielli, Giorgio Levi
1992 Theoretical Computer Science  
Theorem 8. 7 7 (Equivalence of the fixpoint and the unfolding semantics). Let P be u program. Then 'g(P) = 3 (P). Corollary 8.8 (Equivalence of the fixpoint and the operational semantics).  ...  of concurrency and logic programming.  ...  Appendix A In this appendix, we give the proofs of some technical lemmata and theorems concerning the equivalence results for the unfolding and the fixpoint semantics.  ... 
doi:10.1016/0304-3975(92)90288-q fatcat:lhqxkyc4cvgofjn375qmz4olxi

Page 2866 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
We show that many-valued disjunctive logic programs under the semantics of minimal models, perfect models, stable models, and least model states can be unfolded to equivalent clas- sical disjunctive logic  ...  Using these results on unfolding many-valuedness, we then give many-valued fixpoint characterizations for the set of all minimal models and the least model state.  ... 

Correction of Functional Logic Programs [chapter]

Maria Alpuente, Demis Ballis, Francisco J. Correa, Moreno Falaschi
2003 Lecture Notes in Computer Science  
We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), approach for the automatic correction of functional logic programs which is driven by a set of evidence examples  ...  We propose a new methodology for synthesizing correct functional logic programs.  ...  The fixpoint of T ϕ R correctly approximates the fixpoint semantics of R and can be computed finitely.  ... 
doi:10.1007/3-540-36575-3_5 fatcat:ek3tubfmszf7dpvlhjbd4om4hm

S-semantics for logic programming: A retrospective look

Annalisa Bossi
2009 Theoretical Computer Science  
The approach has been applied to several extensions of positive logic programs and used to develop semantic-based techniques for program analysis, verification and transformation.  ...  The aim of such an approach was that of providing a suitable base for program analysis by means of a semantics which really captures the operational behavior of logic programs, and thus offers useful notions  ...  Unfolding is a well-known program transformation operation which allows us to partially evaluate a program by expanding procedure definitions at the calling point.  ... 
doi:10.1016/j.tcs.2009.07.039 fatcat:g65x4lanenbqxluozef34rsipq

Page 6926 of Mathematical Reviews Vol. , Issue 93m [page]

1993 Mathematical Reviews  
Masalagiu (R-IASI-SM) 93m:68030 68N17 68Q55 Gabbrielli, Maurizio (I-PISA-IF); Levi, Giorgio (I-PISA-IF) Unfolding and fixpoint semantics of concurrent constraint logic programs.  ...  Using an abstract notion of interpretation for cc(#) programs, the unfolding semantics is defined.  ... 

Fold/Unfold Transformations for Fixpoint Logic [chapter]

Naoki Kobayashi, Grigory Fedyukovich, Aarti Gupta
2020 Lecture Notes in Computer Science  
We formalize fold/unfold transformations for fixpoint logic formulas and show how they can be used to enhance a recent fixpoint-logic approach to automated program verification, including automated verification  ...  of relational and temporal properties.  ...  This work was supported in part by the University of Tokyo-Princeton Strategic Partnership Grant, JSPS KAKENHI Grant Number JP15H05706, and NSF (USA) award FMitF 1837030.  ... 
doi:10.1007/978-3-030-45237-7_12 fatcat:c3islramjnagvfc5rgjby4p56i

Transformation-based bottom-up computation of the well-founded model [chapter]

Stefan Brass, Ulrich Zukowski, Burkhard Freitag
1997 Lecture Notes in Computer Science  
) , the well-founded magic sets method (Kemp et al., 1995) and the magic alternating fixpoint procedure (Morishita, 1996) .  ...  We present a framework for expressing bottom-up algorithms to compute the well-founded model of non-disjunctive logic programs.  ...  Acknowledgements We would like to thank two referees, the comments of which helped to put this paper in its current form.  ... 
doi:10.1007/bfb0023807 fatcat:l554heuehfbqjlkpmid65wa6q4

The s-semantics approach: Theory and applications

Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maurizio Martelli
1994 The Journal of Logic Programming  
This paper is a general overview of an approach to the semantics of logic programs whose aim is to find notions of models which really capture the operational semantics, and are, therefore, useful for  ...  The semantics in terms of extended interpretations can be obtained as a result of both an operational (top-down) and a fixpoint (bottom-up) construction.  ...  The unfolding of the clauses of program P using the procedure definitions in program Z is denoted by UflfP (Z).  ... 
doi:10.1016/0743-1066(94)90026-4 fatcat:5d5ypkaogvafhk2lxz43h3c4mq

Page 8878 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
bilattices in the semantics of logic programming”, sub- mitted].  ...  Summary: “We extend the answer set semantics to a class of logic programs with nested expressions permitted in the bodies and heads of rules.  ... 

Nondeterminacy and recursion via stacks and games

Wim H Hesselink
1994 Theoretical Computer Science  
One step consists of unfolding the declaration of the recursive procedures. Fixpoint induction is used to prove the validity of this step.  ...  The compositional semantics of the unfolded declaration is proved to be equal to a formal semantics of a stack implementation of the recursive procedures.  ...  Acknowledgment I gratefully acknowledge the contributions of J.E. Jonker to the proof of Theorem 5.4 and of A. Thijs to the concepts and results of Section 6.  ... 
doi:10.1016/0304-3975(92)00016-k fatcat:l56urfsyxje4fcdt33e4dy56ly
« Previous Showing results 1 — 15 out of 1,175 results