8. ISLP 1991: San Diego, California, USA

Vijay A. Saraswat, Kazunori Ueda (Eds.): Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28 - Nov 1, 1991. MIT Press 1991, ISBN 0-262-69147-7

Programming Environments

Yosee Feldman, Ehud Y. Shapiro: Temporal Debugging and its Visual Animation. 3-17
Mireille Ducassé: Abstract Views of Prolog Executions in Opium. 18-32

Non-Horn Programs

Taisuke Sato, Fumio Motoyoshi: A Complete Top-Down Interpreter for First Order Programs. 35-53
David W. Reed, Donald W. Loveland, Bruce T. Smith: An Alternative Characterization of Disjunctive Logic Programs. 54-68

Non-Monotonicity I

Melvin Fitting: Well-Founded Semantics, Generalized. 71-84
Antonis C. Kakas, Paolo Mancarella: Stable Theories for Logic Programs. 85-100

Reasoning about Programs I

Laurent Fribourg: Automatic Generation of Simplification Lemmas for Inductive Proofs. 103-116
Maurice Bruynooghe, Danny De Schreye, Bern Martens: A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. 117-131

Concurrency and Parallelism I

Kish Shen, Manuel V. Hermenegildo: A Simulation Study of Or- and and Independent And-parallelism. 135-151
Gopal Gupta, Vítor Santos Costa, Rong Yang, Manuel V. Hermenegildo: IDIOM: Integrating Dependent And-, Independent And-, and Or-parallelism. 152-166
Sverker Janson, Seif Haridi: Programming Paradigms of the Andorra Kernel Language. 167-183

Types and Rewriting

Bob Carpenter: Typed Feature Structures: A Generalization of First-Order Terms. 187-201
T. L. Lakshman, Uday S. Reddy: Typed Prolog: A Semantic Reconstruction of the Mycroft-O'Keefe Type System. 202-217

Non-Classical Logics I

Ron van der Meyden: A Clausal Logic for Deontic Action Specification. 221-238
Laura Giordano, Alberto Martelli: A Modal Reconstruction of Blocks and Modules in Logic Programming. 239-253

Warren Abstract Machine

André Mariën, Bart Demoen: A New Scheme for Unification in WAM. 257-271
Christoph Beierle, Gregor Meyer, Heiner Semle: Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution. 272-286

Non-Classical Logics II

William W. Wadge: Higher-Order Horn Logic Programming. 289-303
James Harland, David J. Pym: The Uniform Proof-Theoretic Foundation of Linear Logic Programming. 304-318

Bottom-Up Evaluation

Raghu Ramakrishnan, S. Sudarshan: Top-Down versus Bottom-Up Revisited. 321-336
David B. Kemp, Divesh Srivastava, Peter J. Stuckey: Magic Sets and Bottom-Up Evaluation of Well-Founded Models. 337-351

Language Constructs

Péter Szeredi: Using Dynamic Predicates in an Or--Parallel Prolog System. 355-371
Scott Dietzen, Frank Pfenning: A Declarative Alternative to "Assert" in Logic Programming. 372-386
David B. Kemp, Peter J. Stuckey: Semantics of Logic Programs with Aggregates. 387-401

Constraints I

Bruno De Backer, Henri Beringer: Intelligent Backtracking for CLP Languages: An Application to CLP(R). 405-419
Niels Jørgensen, Kim Marriott, Spiro Michaylov: Some Global Compile-Time Optimizations for CLP(R). 420-434
Yves Caseau: Abstract Interpretation of Constraints on Order-Sorted Domains. 435-452

Concurrency and Parallelism II

Ian T. Foster, William H. Winsborough: Copy Avoidance through Compile-Time Analysis and Local Reuse. 455-469
Yasuo Hidaka, Hanpei Koike, Jun'ichi Tatemura, Hidehiko Tanaka: A Static Load Partitioning Method based on Execution Profile for Committed Choice Languages. 470-484
Håkan Millroth: Reforming Compilation of Logic Programs. 485-499

Reasoning about Programs II

Lutz Plümer: Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms. 503-517
Yehoshua Sagiv: A Termination Test for Logic Programs. 518-532
Pierre Deransart, Gérard Ferrand, Michel Téguia: NSTO Programs (Not Subject to Occur-Check). 533-547

Non-Monotonicity II

Raymond T. Ng, V. S. Subrahmanian: Relating Dempster-Shafer Theory to Stable Semantics. 551-565
Luís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes: Counterfactual Reasoning Based on Revising Assumptions. 566-577

Applications

Thomas Filkorn, Richard Schmid, Erik Tidén, Peter Warkentin: Experiences from a Large Industrial Circuit Design Application. 581-595
Paul A. Strooper, Daniel Hoffman: Prolog Testing of C Modules. 596-608

Program Transformation and Synthesis

Tadashi Kawamura: Derivation of Efficient Logic Programs by Synthesizing New Predicates. 611-625
Hideaki Nakayama: Program Transformation under the Principle of Proof as Program. 626-640
Kung-Kiu Lau, Steven David Prestwich: Synthesis of a Family of Recursive Sorting Procedures. 641-658

Constraints II

Christoph Brzoska: Temporal Logic Programming and its Relation to Constraint Logic Programming. 661-677
Igor Mozetic, Christian Holzbaur: Integrating Numerical and Qualitative Models within Constraint Logic Programming. 678-693
Ugo Montanari, Francesca Rossi: True Concurrency in Concurrent Constraint Programming. 694-713

Invited Talks

Johan van Benthem: Reasoning and Programming: Analogies between Logic and Computation. 717-718
Koichi Furukawa: Fifth Generation Computer Project: Towards Large-Scale Knowledge Information Processing. 719-731

Advanced Tutorials

Teodor C. Przymusinski: Non-Monotonic Reasoning and Logic Programming. 735-736
Ian T. Foster, Carl Kesselman, Stephen Taylor: Using Compositional Programming to Write Portable, High-Performance Parallel Programs. 737-738

Copyright © Mon Nov 2 21:13:27 2009 by Michael Ley (ley@uni-trier.de)