8. ISLP 1991: San Diego, California, USA

Programming Environments

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

Non-Horn Programs

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

Non-Monotonicity I

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

Reasoning about Programs I

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

Concurrency and Parallelism I

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

Types and Rewriting

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

Non-Classical Logics I

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

Warren Abstract Machine

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

Non-Classical Logics II

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

Bottom-Up Evaluation

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

Language Constructs

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

Constraints I

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

Concurrency and Parallelism II

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

Reasoning about Programs II

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

Non-Monotonicity II

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

Applications

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

Program Transformation and Synthesis

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

Constraints II

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

Invited Talks

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

Advanced Tutorials

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