Conferences in DBLP
John W. Lloyd Practical Advtanages of Declarative Programming. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:18-30 [Conf ] Michael Nitsche Analysis and Refinement of Constraint Answer Sets in a Planning System. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:31-45 [Conf ] Paolo Mascellani , Dino Pedreschi Proving termination of Prolog programs. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:46-61 [Conf ] María Alpuente , Moreno Falaschi , María José Ramis , Germán Vidal A Compositional Semantics for Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:62-76 [Conf ] Roberto Giacobazzi Characterizing Abstract Program Properties by Abduction. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:77-91 [Conf ] Baudouin Le Charlier , Sabina Rossi , Pascal Van Hentenryck An Abstract Interpretation Framework for (almost) Full Prolog. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:92-106 [Conf ] Paolo Volpe Semantics of Concurrent Logic Programming as Uniform Proofs. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:107-124 [Conf ] Salvador Lucas , Javier Oliver El lambda-calculo Etiquetado Paralelo (LCEP). [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:125-139 [Conf ] Moreno Falaschi , Maurizio Gabbrielli , Kim Marriott , Catuscia Palamidessi Confluence and Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:140-154 [Conf ] F. Buffoli Split Resolution Tailoring Tableaux to Refute Clause Sets. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:155-169 [Conf ] Marco Comini , Giorgio Levi An Algebraic Theory of Observables. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:170-186 [Conf ] Maurizio Martelli , Alessandro Messora , Catuscia Palamidessi , Alain Hui-Bon-Hoa Fixpoint Semantics of L lambda. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:187-201 [Conf ] Maurizio Proietti , Alberto Pettorossi Total correctness of a goal replacement rule based on the unfold/fold proof method. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:203-217 [Conf ] Sandro Etalle , Maurizio Gabbrielli Modular Transformations of CLP Programs. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:218-233 [Conf ] K. Bohlmann , Rita Loogen , Yolanda Ortega-Mallén Towards a Functional Process Calculus. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:234-250 [Conf ] Ramiro Varela El modelo RPS para la gestion del paralelismo AND independiente en programas logicos. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:251-265 [Conf ] José E. Gallardo , P. Guerrero , Blas C. Ruiz Monadas y Procesos Funcionales Comunicantes. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:266-280 [Conf ] Francisco Bueno Methods for Automatic Compile-time Parallelization of Logic Programs: the MEL, CDG and UDG Algorithms Revisited. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:281-295 [Conf ] Nai-Wei Lin Optimizing Logic Programs with Finite Domain Constraints. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:297-311 [Conf ] Roberto Bagnara On the Detection of Implicit and Redundant Numeric Constraint in CLP Programs. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:312-326 [Conf ] Michael Codish , Bart Demoen Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:327-341 [Conf ] María-del-Mar Gallardo , José M. Troya Granularity Analysis of Concurrent Logic Languages based on Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:342-356 [Conf ] Gilberto Filé , Francesco Ranzato Improving Abstract Interpretations by Systematic Lifting to the Powerset. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:357-371 [Conf ] Agostino Cortesi , Gilberto Filé , William H. Winsborough The Quotient of an Abstract Interpretation for Comparing Static Analyses. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:372-387 [Conf ] Filomena Ferrucci , Giuliano Pacini , Maria I. Sessa Loop Checking for Reduced SLD-derivations. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:388-402 [Conf ] Agostino Dovier , Eugenio G. Omodeo , Alberto Policriti , Gianfranco Rossi Solving Systems of Equations over Hypersets. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:403-417 [Conf ] Termination is Language-Independent. [Citation Graph (, )][DBLP ] Anastasia Analyti , Sakti Pramanik Semantics for Reasoning with Contradictory Extended Logic Programs. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:434-448 [Conf ] Francesco Buccafurri , Nicola Leone , Pasquale Rullo A non-deterministic semantics for ordered logic programs. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:449-463 [Conf ] Roberta Gori , Giorgio Levi Finite Failure is AND-Compositional. [Citation Graph (0, 0)][DBLP ] GULP-PRODE (1), 1994, pp:464-478 [Conf ]