6. SLP/NACLP 1989: Cleveland, Ohio

Ewing L. Lusk, Ross A. Overbeek: Logic Programming, Proceedings of the North American Conference 1989, Cleveland, Ohio, October 16-20, 1989. MIT Press 1989, ISBN 0-262-62064-2 (2 Volumes)

Constraint Logic Programming

Molly Wilson, Alan Borning: Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison. 3-19
Michael J. Maher, Peter J. Stuckey: Expanding Query Power in Constraint Logic Programming Languages. 20-36
Jean-Louis Lassez, Tien Huynh, Ken McAloon: Simplification and Elimination of Redundant Linear Arithmetic Constraints. 37-51
Nevin Heintze, Spiro Michaylov, Peter J. Stuckey, Roland H. C. Yap: On Meta-Programming in CLR(R). 52-66

Proof Theory

Marc Bezem: Characterizing Termination of Logic Programs with Level Mappings. 69-80
Marek A. Suchenek: A Syntactic Characterization of Minimal Entailment. 81-91
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andrea Silva: Computing Answers to Logic Programs with Weak Model Elimination. 92-114
Toshiro Wakayama: Monadic Cases: Rediscovering Input Resolution. 115-130

Abstract Interpretation

William H. Winsborough: Path-Dependent Reachability Analysis for Multiple Specialization. 133-153
Dean Jacobs, Anno Langen: Accurate and Efficient Approximation of Variable Aliasing in Logic Programs. 154-165
Kalyan Muthukumar, Manuel V. Hermenegildo: Determination of Variable Dependence Information through Abstract Interpretation. 166-185

Applications

David B. Searls: Investigating the Linguistics of DNA with Definite Clause Grammars. 189-208
Xiaoping He, George W. Ernst, Fred Discenzo: An Expert System which Intelligently Accesses an External Database. 209-223
Shaul Markovitch, Paul D. Scott: Automatic Ordering of Subgoals - A Machine Learning Approach. 224-240

Nonmonotonic Inference

V. Wiktor Marek, Miroslaw Truszczynski: Stable Semantics for Logic Programs and Default Theories. 243-256
Aïda Batarekh: Convergence Issues and Fixed Points of Non-Monotone Maps. 257-273
Stephen G. Pimentel, John L. Cuadrado: A Truth Maintenance System Based on Stable Models. 274-290
Jia-Huai You, Liwu Li: Supported Circumscription and Its Relation to Logic Programming with Negation. 291-309

Parallel Implementations

Balkrishna Ramkumar, Laxmikant V. Kalé: Compiled Execution of the Reduce-OR Process Model on Multiprocessors. 313-331
Gopal Gupta, Bharat Jayaraman: Combined And-Or Parallelism on Shared Memory Multiprocessors. 332-349
Si-En Chang, Y. Paul Chiang: Restricted AND-Parallelism Execution Model with Side-Effects. 350-368
Manuel V. Hermenegildo, Francesca Rossi: On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs. 369-389
Vikram A. Saletore, Laxmikant V. Kalé: Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs. 390-406

Software Engineering

Yves Deville, Jean Burnay: Generalization and Program Schemata: A Step Towards Computer-Aided Construction of Logic Programs. 409-425
Arun Lakhotia: Incorporating `Programming Techniques' into Prolog Programs. 426-440
Paola Mello, Antonio Natali, Cristina Ruggieri: Logic Programming in a Software Engineering Perspective. 441-458

Constructive Negation

Jan Maluszynski, Torbjörn Näslund: Fail Substitutions for Negation as Failure. 461-476
David Chan: An Extension of Constructive Negation and its Application in Coroutining. 477-493

Concurrent Logic Programming

Ian T. Foster, Stephen Taylor: Strand: A Practical Parallel Programming Tool. 497-512
Kenneth M. Kahn, William A. Kornfeld: Money as a Concurrent Logic Program. 513-535
Sven-Olof Nyström: Variable-Free Execution of Concurrent Logic Languages. 536-552
Haim Gaifman, Michael J. Maher, Ehud Y. Shapiro: Reactive Behaviour Semantics for Concurrent Constraint Logic Programs. 553-569

Semantics

Arcot Rajasekar, Jack Minker: A Stratification Semantics for General Disjunctive Programs. 573-586
Phan Minh Dung, Kanchana Kanchanasut: On the Generalized Predicate Completion of Non-Horn Programs. 587-603
Phan Minh Dung, Kanchana Kanchanasut: A Fixpoint Approach to Declarative Semantics of Logic Programs. 604-625
James Harland: A Kripke-like Model for Negation as Failure. 626-642

Program Transformation

Michele Bugliesi, F. Russo: Partial Evaluation in Prolog: Some Improvements about Cut. 645-660
Koichi Furukawa, Hiroshi Fujita, Toramatsu Shintani: Deriving an Efficient Production System by Partial Evaluation. 661-674

Performance of Parallel Systems

Zheng Lin: Expected Performance of the Randomized Parallel Backtracking Method. 677-696
Shyam Mudambi: Performance Analysis of Aurora on a Switch-Based Multiprocessor. 697-712
Péter Szeredi: Performance Analysis of the Aurora Or-Parallel Prolog System. 713-732

Logic Grammars

H. Lewis Chau: Narrowing Grammar: A Comparison with Other Logic Grammars. 735-754
Arendse Bernth: Discourse Understanding in Logic. 755-771
Srinivas R. Sataluri, Arthur C. Fleck: Semantic Specification Using Logic Programs. 772-791

Database I

Ravi Krishnamurthy, Shamim A. Naqvi, Carlo Zaniolo: Database Transactions in LDL. 795-815
Jiawei Han, Ling Liu: Processing Multiple Linear Recursions. 816-830
Anthony J. Bonner, L. Thorne McCarty, Kumar V. Vadaparty: Expressing Database Queries with Intuitionistic Logic. 831-850
Weidong Chen, David Scott Warren: Abductive Resoning with Structured Data. 851-867

Implementation Topics

Micha Meier: Event Handling in Prolog. 871-887
V. S. Madan, C.-J. Peng, Gurindar S. Sohi: On the Adequacy of Direct Mapped Caches for Lisp and Prolog Data Reference Patterns. 888-906
Yu Inamura, Nobuyuki Ichiyoshi, Kazuaki Rokusawa, Katsuto Nakajima: Optimizing Techniques Using the MRB and Their Evaluation on the Multi-PSI/V2. 907-921
Lu Xu, Hanpei Koike, Hidehiko Tanaka: Distributed Garbage Collection for the Parallel Inference Engine PIE64. 922-941

Database II

A. Richard Helm: On the Dedection and Elimination of Redundant Derivations during Bottom-up Execution. 945-962
Michael J. Maher, Raghu Ramakrishnan: Déjà Vu in Fixpoints of Logic Programs. 963-980
David B. Kemp, Kotagiri Ramamohanarao, Isaac Balbin, Krishnamurthy Meenakshi: Propagating Constraints in Recusive Deduction Databases. 981-998

WAM I

Bart Demoen, André Mariën, Alain Callebaut: Indexing Prolog Clauses. 1001-1012
Damir Jamsek, Kevin J. Greene, Shiu-Kai Chin, Paul R. Humenn: WINTER: WAMS in Tim Expression Reduction. 1013-1029
André Mariën, Bart Demoen: On the Management of Choicepoint and Environment Frames in the WAM. 1030-1047

Extensions to Logic Programming

Bharat Jayaraman, David A. Plaisted: Programming with Equations, Subsets, and Relations. 1051-1068
Michael Kifer, V. S. Subrahmanian: On the Expressive Power of Annotated Logic Programs. 1069-1089
Weidong Chen, Michael Kifer, David Scott Warren: HiLog: A First-Order Semantics for Higher-Order Logic Programming Constructs. 1090-1114
Changwoo Pyo, Uday S. Reddy: Inference of Polymorphic Types for Logic Programs. 1115-1132

WAM II

Ashok Singhal, Yale N. Patt: Unification Parallelism: How Much Can We Exploit? 1135-1147
Peter Van Roy: An Intermediate Language to Support Prolog's Unification. 1148-1164
Akihiko Konagaya, Shinichi Habata, Atsushi Atarashi, Minoru Yokota: Performance Evaluation of a Sequential Inference Machine CHI. 1165-1179
Gopalan Nadathur, Bharat Jayaraman: Towards a WAM Model for Lambda-Prolog. 1180-1198

Invited Talks

E. W. Elcock: Absys: The Historical Inevitability of Logic Programming. 1201-1214
Jack Minker: Toward A Foundation of Disjunctive Logic Programming. 1215-1235
Teodor C. Przymusinski: On Constructive Negation in Logic Programming. 0-0

Last update Thu May 23 05:15:09 2013 CET by the DBLP Team —

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