12. ILPS 1995: Portland, Oregon

John W. Lloyd (Ed.): Logic Programming, Proceedings of the 1995 International Symposium, December 4-7, 1995, Portland, Oregon. MIT Press 1995, ISBN 0-262-62099-5

Invited Talks

Nachum Dershowitz: Goal Solving as Operational Semantics. 3-17
Philip Wadler: How to Declare an Imperative. 18-32
William J. McClay: Surviving the AI Winter. 33-47
Joxan Jaffar, Michael J. Maher, Gustaf Neumann: Logic Programming and Object Modelling: A Case Study (Abstract). 48

Language Design

Yves Bekkers, Paul Tarau: Monadic Constructs for Logic Programming. 51-65
Michael Winikoff, James Harland: Implementing the Linear Logic Programming Language Lygon. 66-80

Databases

Mengchi Liu: Relationlog: A Typed Extension to Datalog with Sets and Tuples (Extended Abstract). 83-97
David Toman: Top-Down beats Bottom-Up for Constraint Based Extensions of Datalog. 98-112

Objects

Giorgio Delzanno, Maurizio Martelli: Objects in Forum. 115-129
Hasan M. Jamil, Laks V. S. Lakshmanan: A Declarative Semantics for Behavioral Inheritance and Conflict Resolution. 130-144

Functional Logic Programming

Christian Prehofer: A Call-by-Need Strategy for Higher-Order Functional-Logic Programming. 147-161
Didier Bert, Rachid Echahed: Abstraction of Conditional Term Rewriting Systems. 162-176

Foundations I

Alain Hui-Bon-Hoa: Clause-based proofs for hereditary Harrop formulas. 179-193
Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Terrance Swift: Optimizing Clause Resolution: Beyond Unification Factoring. 194-208
Gérard Ferrand, Arnaud Lallouet: A Compositional Proof Method of Partial Correctness for Normal Logic Programs. 209-223

Implementation

Björn Carlson, Mats Carlsson, Sverker Janson: The implementation of AKL(FD). 227-241
Thomas C. Conway, Fergus Henderson, Zoltan Somogyi: Code Generation for Mercury. 242-256
Peter A. Bigot, Saumya K. Debray: A Simple Approach to Supporting Untagged Objects in Dynamically Typed Languages. 257-271

Foundations II

Marco Comini, Giorgio Levi, Giuliana Vitiello: Declarative Diagnosis Revisited. 275-287
Jonas Barklund, Pierangelo Dell'Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone: Semantical Properties of Encodings in Logic Programming. 288-302
Christoph Brzoska: Temporal Logic Programming in Dense Time. 303-317

Analysis I

Roberto Giacobazzi, Francesco Ranzato: Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics. 321-335
Gerda Janssens, Maurice Bruynooghe, Veroniek Dumortier: A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs. 336-350
John P. Gallagher, Dmitri Boulanger, Hüseyin Saglam: Practical Model-Based Static Analysis for Definite Logic Programs. 351-365

Nonmonotonic Reasoning

Yannis Dimopoulos, Antonis C. Kakas: Logic Programming without Negation as Failure. 369-383
Jia-Huai You, Suryanil Ghosh, Li-Yan Yuan, Randy Goebel: An Introspective Framework for Paraconsistent Logic Programs. 384-398
Nicola Leone, Francesco Scarcello: Declarative and Fixpoint Characterizations of Disjunctive Stable Models. 399-413

Analysis II

Maria J. García de la Banda, Kim Marriott, Peter J. Stuckey: Efficient Analysis of Logic Programs with Dynamic Scheduling. 417-431
Thomas Lindgren: Control Flow Analysis of Prolog. 432-446
Elena Marchiori, Frank Teusink: Proving Termination of Logic Programs with Delay Declarations. 447-461

Transformation

Morten Heine Sørensen, Robert Glück: An Algorithm of Generalization in Positive Supercompilation. 465-479
Kung-Kiu Lau, Mario Ornaghi, Alberto Pettorossi, Maurizio Proietti: Correctness of Logic Program Transformations Based on Existential Termination. 480-494
Michael Leuschel, Bern Martens: Partial Deduction of the Ground Representation and its Application to Integrity Checking. 495-509

Constraints

Jean-Francois Puget, Michel Leconte: Beyond the Glass Box: Constraints as Objects. 513-527
Frank S. de Boer, Maurizio Gabbrielli: Modelling Real-Time in Concurrent Constraint Programming. 528-542
Kung-Kiu Lau, Mario Ornaghi: A Formal Approach to Deductive Synthesis of Constraint Logic Programs. 543-557

Semantics

Marco Comini, Giorgio Levi, Maria Chiara Meo: Compositionality in SLD-Derivations and their Abstractions. 561-575
Bernard Malfon, Gérard Ferrand: Type Correct programs: A semantic approach. 576-590
James H. Andrews: A Paralogical Semantics for the Prolog Cut. 591-605

Tutorial Abstracts

Chris Moss: Logic and Objects (Tutorial Abstract). 609-611
Herbert Kuchen: Implementation Issues for Functional Logic Programming (Tutorial Abstract). 612-613
Håkan Millroth: Tradeoffs Explicit and Omplicit Parallelism (Tutorial Abstract). 614
Danny De Schreye, Michael Leuschel, Bern Martens: Tutorial on Program Specialisation (Abstract). 615-616

Panel Abstracts

John W. Lloyd: Integration of Functional and Logic Programming Languages (Panel Abstract). 619-620
Hassan Aït-Kaci: Déjá Vu - Or Whatever Are We Doing Here?... (Panel Abstract). 621-624
Michael Hanus: Functional Logic Languages: Combine Search and Efficient Evaluation (Panel Abstract). 625-626
Uday S. Reddy: Bridging the gap between logic and functional programming (Panel Abstract). 627-628
Mario Rodríguez-Artalejo: The Challenge of Declarative Programming (Panel Abstract). 629-630

Poster Abstracts

Herbert Kuchen, Josef Anastasiadis: Higher Order Babel. 633
Vasco Pedro, Luís Monteiro: An Approach to Verification in Contextual Logic Programming. 634
Alon Y. Levy, Marie-Christine Rousset: Combining Rules and Description Logics: An Overview of CARIN. 635
James Harland, David J. Pym, Michael Winikoff: Programming in Lygon: A Brief Overview. 636
Kannan Govindarajan, Bharat Jayaraman, Surya Mantha: Relaxation in Constraint Logic Languages. 637
Barbara Messing, Peter v. Stackelberg: Regular Signed Resolution Applied to Annotated Logic Programs. 638
Corin A. Gurr: Declarative Annotations for Logic Programs. 639
Man-lai Tse, Wing-hang Wong, Ho-Fung Leung: P&P: A Combined Parlog and Prolog Concurrent Object-Oriented Logic Programming Language. 640
Lubos Brim, David Gilbert, Jean-Marie Jacquet, Mojmír Kretínský: Synchronisation in Scc. 641
Paul Tarau, Verónica Dahl, Andrew Fall: Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars. 642

Last update Sat May 25 19:06:11 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page