Vijay A. Saraswat, Kazunori Ueda
Proceedings of the Eighth International Symposium on Logic Programming
ILPS, 1991.

@proceedings{ISLP-1991,
	address       = "San Diego, California, USA",
	editor        = "Vijay A. Saraswat and Kazunori Ueda",
	isbn          = "0-262-69147-7",
	publisher     = "{MIT Press}",
	title         = "{Proceedings of the Eighth International Symposium on Logic Programming}",
	year          = 1991,
}

Contents (47 items)

14 ×#logic programming
11 ×#source code
5 ×#prolog
4 ×#constraints
4 ×#programming
4 ×#semantics
3 ×#proving
3 ×#reasoning
2 ×#automation
2 ×#bottom-up

ISLP-1991-FeldmanS #animation #debugging #visual notation

Temporal Debugging and its Visual Animation (YF, EYS), pp. 3–17.

ISLP-1991-Ducasse #prolog

Abstract Views of Prolog Executions in Opium (MD), pp. 18–32.

ISLP-1991-SatoM #first-order #interpreter #source code #top-down

A Complete Top-Down Interpreter for First Order Programs (TS, FM), pp. 35–53.

ISLP-1991-ReedLS #logic programming #source code

An Alternative Characterization of Disjunctive Logic Programs (DWR, DWL, BTS), pp. 54–68.

ISLP-1991-Fitting #semantics

Well-Founded Semantics, Generalized (MF), pp. 71–84.

ISLP-1991-KakasM #logic programming #source code

Stable Theories for Logic Programs (ACK, PM), pp. 85–100.

ISLP-1991-Fribourg #automation #generative #induction #proving

Automatic Generation of Simplification Lemmas for Inductive Proofs (LF), pp. 103–116.

ISLP-1991-BruynoogheSM #deduction #infinity #logic programming #source code

A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.

ISLP-1991-ShenH #independence #simulation

A Simulation Study of Or- and and Independent And-parallelism (KS, MVH), pp. 135–151.

ISLP-1991-GuptaCYH #independence #named

IDIOM: Integrating Dependent And-, Independent And-, and Or-parallelism (GG, VSC, RY, MVH), pp. 152–166.

ISLP-1991-JansonH #kernel #paradigm #programming

Programming Paradigms of the Andorra Kernel Language (SJ, SH), pp. 167–183.

ISLP-1991-Carpenter #first-order

Typed Feature Structures: A Generalization of First-Order Terms (BC), pp. 187–201.

ISLP-1991-LakshmanR #prolog #re-engineering #semantics #type system

Typed Prolog: A Semantic Reconstruction of the Mycroft-O’Keefe Type System (TLL, USR), pp. 202–217.

ISLP-1991-Meyden #logic #specification

A Clausal Logic for Deontic Action Specification (RvdM), pp. 221–238.

ISLP-1991-GiordanoM #logic programming #re-engineering

A Modal Reconstruction of Blocks and Modules in Logic Programming (LG, AM), pp. 239–253.

ISLP-1991-MarienD #unification

A New Scheme for Unification in WAM (AM, BD), pp. 257–271.

ISLP-1991-BeierleMS #automaton #order #polymorphism

Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution (CB, GM, HS), pp. 272–286.

ISLP-1991-Wadge #higher-order #logic programming

Higher-Order Horn Logic Programming (WWW), pp. 289–303.

ISLP-1991-HarlandP #linear #logic programming

The Uniform Proof-Theoretic Foundation of Linear Logic Programming (JH, DJP), pp. 304–318.

ISLP-1991-RamakrishnanS #bottom-up #revisited #top-down

Top-Down versus Bottom-Up Revisited (RR, SS), pp. 321–336.

ISLP-1991-KempSS #bottom-up #evaluation #modelling #set

Magic Sets and Bottom-Up Evaluation of Well-Founded Models (DBK, DS, PJS), pp. 337–351.

ISLP-1991-Szeredi #prolog #using

Using Dynamic Predicates in an Or--Parallel Prolog System (PS), pp. 355–371.

ISLP-1991-DietzenP #declarative #logic programming

A Declarative Alternative to “Assert” in Logic Programming (SD, FP), pp. 372–386.

ISLP-1991-KempS #logic programming #semantics #source code

Semantics of Logic Programs with Aggregates (DBK, PJS), pp. 387–401.

ISLP-1991-BackerB #backtracking

Intelligent Backtracking for CLP Languages: An Application to CLP(R) (BDB, HB), pp. 405–419.

ISLP-1991-JorgensenMM #optimisation

Some Global Compile-Time Optimizations for CLP(R) (NJ, KM, SM), pp. 420–434.

ISLP-1991-Caseau #abstract interpretation #constraints #order

Abstract Interpretation of Constraints on Order-Sorted Domains (YC), pp. 435–452.

ISLP-1991-FosterW #analysis #reuse

Copy Avoidance through Compile-Time Analysis and Local Reuse (ITF, WHW), pp. 455–469.

ISLP-1991-HidakaKTT #clustering #commit #execution

A Static Load Partitioning Method based on Execution Profile for Committed Choice Languages (YH, HK, JT, HT), pp. 470–484.

ISLP-1991-Millroth #compilation #logic programming #source code

Reforming Compilation of Logic Programs (HM), pp. 485–499.

ISLP-1991-Plumer #automation #prolog #proving #source code #termination

Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms (LP), pp. 503–517.

ISLP-1991-Sagiv #logic programming #source code #termination

A Termination Test for Logic Programs (YS), pp. 518–532.

ISLP-1991-DeransartFT #source code

NSTO Programs (Not Subject to Occur-Check) (PD, GF, MT), pp. 533–547.

ISLP-1991-NgS #semantics

Relating Dempster-Shafer Theory to Stable Semantics (RTN, VSS), pp. 551–565.

ISLP-1991-PereiraAA #reasoning

Counterfactual Reasoning Based on Revising Assumptions (LMP, JNA, JJA), pp. 566–577.

ISLP-1991-FilkornSTW #case study #design #experience #industrial #scalability

Experiences from a Large Industrial Circuit Design Application (TF, RS, ET, PW), pp. 581–595.

ISLP-1991-StrooperH #c #prolog #testing

Prolog Testing of C Modules (PAS, DH), pp. 596–608.

ISLP-1991-Kawamura #logic programming #performance #source code

Derivation of Efficient Logic Programs by Synthesizing New Predicates (TK), pp. 611–625.

ISLP-1991-Nakayama #principle #program transformation #proving

Program Transformation under the Principle of Proof as Program (HN), pp. 626–640.

ISLP-1991-LauP #product line #recursion #sorting #synthesis

Synthesis of a Family of Recursive Sorting Procedures (KKL, SDP), pp. 641–658.

ISLP-1991-Brzoska #constraints #logic programming

Temporal Logic Programming and its Relation to Constraint Logic Programming (CB), pp. 661–677.

ISLP-1991-MozeticH #constraints #logic programming #modelling

Integrating Numerical and Qualitative Models within Constraint Logic Programming (IM, CH), pp. 678–693.

ISLP-1991-MontanariR #concurrent #constraints #programming

True Concurrency in Concurrent Constraint Programming (UM, FR), pp. 694–713.

ISLP-1991-Benthem #logic #programming #reasoning

Reasoning and Programming: Analogies between Logic and Computation (JvB), pp. 717–718.

ISLP-1991-Furukawa #generative #information management #scalability #towards

Fifth Generation Computer Project: Towards Large-Scale Knowledge Information Processing (KF), pp. 719–731.

ISLP-1991-Przymusinski #logic programming #reasoning

Non-Monotonic Reasoning and Logic Programming (TCP), pp. 735–736.

ISLP-1991-FosterKT #composition #parallel #programming #source code #using

Using Compositional Programming to Write Portable, High-Performance Parallel Programs (ITF, CK, ST), pp. 737–738.