Logic Programming: The 11th International Conference

doi:10.7551/mitpress/4316.001.0001

Skip Nav Destination

Logic Programming: The 11th International Conference

Edited by

The MIT Press

DOI:

https://doi.org/10.7551/mitpress/4316.001.0001

ISBN electronic:

9780262257145

Publication date:

1994

Conference proceedings presenting the state-of-the-art in Logic Programming.

Program Committee

Doi:

https://doi.org/10.7551/mitpress/4316.003.0001

PDF
The Association for Logic Programming

Doi:

https://doi.org/10.7551/mitpress/4316.003.0002

PDF
Series Foreword

Doi:

https://doi.org/10.7551/mitpress/4316.003.0003

PDF
Preface

Doi:

https://doi.org/10.7551/mitpress/4316.003.0004

PDF
Referees

Doi:

https://doi.org/10.7551/mitpress/4316.003.0005

PDF
I: Invited Talks

Doi:

https://doi.org/10.7551/mitpress/4316.003.0006
- 1: Lazy Functional State Threads: An Abstract
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0007
  
  PDF
II: Advanced Tutorials

Doi:

https://doi.org/10.7551/mitpress/4316.003.0008
- 2: Implementation of Andorra-based Languages
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0009
  
  PDF
- 3: A Tutorial on Synthesis of Logic Programs from Specifications
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0010
  
  PDF
- 4: Modularity in Logic Programming
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0011
  
  PDF
- 5: Abduction and Abductive Logic Programming
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0012
  
  PDF
III: Semantics I

Doi:

https://doi.org/10.7551/mitpress/4316.003.0013
- 6: Splitting a Logic Program
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0014
  
  PDF
- 7: Language Independence and Language Tolerance in Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0015
  
  PDF
- 8: Computing Stable Models by Program Transformation
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0016
  
  PDF
- 9: Declarative Interpretations Reconsidered
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0017
  
  PDF
IV: Parallelism

Doi:

https://doi.org/10.7551/mitpress/4316.003.0018
- 10: ACE: And/Or-parallel Copying-based Execution of Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0019
  
  PDF
- 11: Hybrid tree search in the Andorra model
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0020
  
  PDF
- 12: Parallel CLP on Heterogeneous Networks
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0021
  
  PDF
- 13: PDP: Prolog Distributed Processorfor Independent AND\OR Parallel Execution of Prolog
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0022
  
  PDF
V: Implementation

Doi:

https://doi.org/10.7551/mitpress/4316.003.0023
- 14: On the Scheme of Passing Arguments in Stack Frames for Prolog
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0024
  
  PDF
- 15: Output Value Placement in Moded Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0025
  
  PDF
- 16: Native Code Compilation in SICStus Prolog
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0026
  
  PDF
VI: Actions

Doi:

https://doi.org/10.7551/mitpress/4316.003.0027
- 17: Representing Actions in Equational Logic Programming
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0028
  
  PDF
- 18: Representing Continuous Change in the Abductive Event Calculus
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0029
  
  PDF
- 19: Concurrency and plan generation in a logic programming language with a sequential operator
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0030
  
  PDF
VII: Semantics II

Doi:

https://doi.org/10.7551/mitpress/4316.003.0031
- 20: Computing Annotated Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0032
  
  PDF
- 21: Conditional Logic Programming
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0033
  
  PDF
- 22: Causal Models of Disjunctive Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0034
  
  PDF
- 23: An Axiomatic Approach to Semantics of Disjunctive Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0035
  
  PDF
VIII: Constraints I

Doi:

https://doi.org/10.7551/mitpress/4316.003.0036
- 24: Finding Conflict Sets and Backtrack Points in CLP(R)
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0037
  
  PDF
- 25: Entailment of Finite Domain Constraints
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0038
  
  PDF
- 26: Notes on the Design of an Open Boolean Solver
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0039
  
  PDF
- 27: Improved CLP Scheduling with Task Intervals
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0040
  
  PDF
IX: Higher-order and Meta Programming

Doi:

https://doi.org/10.7551/mitpress/4316.003.0041
- 28: Ambivalent logic as the semantic basis of metalogic programming: I
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0042
  
  PDF
- 29: Higher-order Aspects of Logic Programming (Summary)
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0043
  
  PDF
- 30: Higher-Order Polymorphic Unification for Logic Programming
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0044
  
  PDF
X: Databases

Doi:

https://doi.org/10.7551/mitpress/4316.003.0045
- 31: A Database Interface for Complex Objects
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0046
  
  PDF
- 32: A slick procedure for integrity checking in deductive databases
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0047
  
  PDF
- 33: LPDA: Another look at Tabulation in Logic Programming
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0048
  
  PDF
XI: Abduction and Negation

Doi:

https://doi.org/10.7551/mitpress/4316.003.0049
- 34: On the Equivalence between Disjunctive and Abductive Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0050
  
  PDF
- 35: The Acceptability Semantics for Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0051
  
  PDF
- 36: A Bottom-up Semantics for Constructive Negation
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0052
  
  PDF
- 37: Default Rules: An Extension of Constructive Negation for Narrowing-based Languages
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0053
  
  PDF
XII: Analysis

Doi:

https://doi.org/10.7551/mitpress/4316.003.0054
- 38: Depth-k Sharing and Freeness
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0055
  
  PDF
- 39: Towards a Practical Full Mode Inference System for CLP(H,N)
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0056
  
  PDF
- 40: A proof method for run-time properties of Prolog programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0057
  
  PDF
- 41: Fast and Precise Regular Approximations of Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0058
  
  PDF
XIII: Constraints II

Doi:

https://doi.org/10.7551/mitpress/4316.003.0059
- 42: Constraint Solving by Narrowing in Combined Algebraic Domains
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0060
  
  PDF
- 43: A Grammatical Approach to DCG Parsing
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0061
  
  PDF
- 44: Compiling Intensional Sets in CLP
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0062
  
  PDF
XIV: Transformation and Synthesis

Doi:

https://doi.org/10.7551/mitpress/4316.003.0063
- 45: The Halting Problem for Deductive Synthesis of Logic Programs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0064
  
  PDF
- 46: A New Transformation based on Process-Message Duality for Concurrent Logic Languages
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0065
  
  PDF
- 47: Compiling Control Revisited: A New Approach based upon Abstract Interpretation
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0066
  
  PDF
- 48: Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0067
  
  PDF
XV: Poster Abstracts

Doi:

https://doi.org/10.7551/mitpress/4316.003.0068
- 49: Conjunto: Constraint propagation over set constraints with finite set domain variables
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0069
  
  PDF
- 50: Logic Programs with Refutation Rules
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0070
  
  PDF
- 51: Efficient and complete demo predicates for definite clause languages
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0071
  
  PDF
- 52: Towards a verified OR-Parallel WAM
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0072
  
  PDF
- 53: Recomputation-Free Lemmatization by Program Transformation
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0073
  
  PDF
- 54: IsaWhelk: Whelk Interpreted in Isabelle
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0074
  
  PDF
- 55: Reflection through Constraint Satisfaction
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0075
  
  PDF
- 56: PP-clauses: a Means for Handling Resources
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0076
  
  PDF
- 57: Logic, Algebra and Static Analysis in DM Systems, the IE Way
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0077
  
  PDF
- 58: Proving Hardware Designs
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0078
  
  PDF
- 59: A Dataflow Analysis Method for Ground Prolog
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0079
  
  PDF
- 60: Logic programming as quantum measurement
  
  Doi:
  
  https://doi.org/10.7551/mitpress/4316.003.0080
  
  PDF
61: Author Index

Doi:

https://doi.org/10.7551/mitpress/4316.003.0081

PDF

Compliance with permission from the rights holder to display this image online prohibits further enlargement or copying.

Logic Programming: The 11th International Conference

Table of Contents

A product of The MIT Press

MIT Press Direct

Information

MIT Press

Contact Us

Logic Programming: The 11th International Conference

Table of Contents

A product of The MIT Press

MIT Press Direct

Information

MIT Press

Contact Us

This Feature Is Available To Subscribers Only