Proceedings of the Eighth International Conference on Logic Programming
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Koichi Furukawa
Proceedings of the Eighth International Conference on Logic Programming
ICLP, 1991.

TEST
DBLP
Scholar
Full names Links ISxN
@proceedings{ICLP-1991,
	address       = "Paris, France",
	editor        = "Koichi Furukawa",
	isbn          = "0-262-56058-5",
	publisher     = "{MIT Press}",
	title         = "{Proceedings of the Eighth International Conference on Logic Programming}",
	year          = 1991,
}

Contents (76 items)

ICLP-1991-Dung #abduction #logic programming
Negations as Hypotheses: An Abductive Foundation for Logic Programming (PMD), pp. 3–17.
ICLP-1991-CasanovaHG
Explaining SLDNF Resolution with Non-Normal Defaults (MAC, ASH, RAdTG), pp. 18–31.
ICLP-1991-PierroMP #logic programming
Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming (ADP, MM, CP), pp. 32–45.
ICLP-1991-MuthukumarH #abstract interpretation
Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation (KM, MVH), pp. 49–63.
ICLP-1991-CharlierMH #abstract interpretation #algorithm #analysis #complexity
A Generic Abstract Interpretation Algorithm and its Complexity Analysis (BLC, KM, PVH), pp. 64–78.
ICLP-1991-CodishDY #algorithm #alias #analysis #safety #unification
Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis (MC, DD, EY), pp. 79–93.
ICLP-1991-ChenW #abstraction #logic #multi #set
An Intensional Logic of (Multi-Arity) Set Abstractions (WC, DSW), pp. 97–110.
ICLP-1991-DovierOPR #finite #logic programming #programming language #set
{log}: A Logic Programming Language with Finite Sets (AD, EGO, EP, GR), pp. 111–124.
ICLP-1991-CodognetS #backtracking
Extending the WAM for Intelligent Backtracking (PC, TS), pp. 127–141.
ICLP-1991-MatyskaJT
Register Allocation in WAM (LM, AJ, DT), pp. 142–156.
ICLP-1991-Meier #prolog #recursion
Recursion versus Iteration in Prolog (MM), pp. 157–169.
ICLP-1991-RollinsW #library #specification
Specifications as Search Keys for Software Libraries (EJR, JMW), pp. 173–187.
ICLP-1991-Monin #compilation #prolog #using
Real-size Compiler Writing Using Prolog with Arrows (JFM), pp. 188–201.
ICLP-1991-Marre #algebra #automation #logic programming #specification #testing #towards #using
Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming (BM), pp. 202–219.
ICLP-1991-MontanariR #constraints #logic programming
Perfect Relaxation in Constraint Logic Programming (UM, FR), pp. 223–237.
ICLP-1991-GabbrielliL #constraints #logic programming #modelling #source code
Modeling Answer Constraints in Constraint Logic Programs (MG, GL), pp. 238–252.
ICLP-1991-Miller #logic programming #unification
Unification of Simply Typed Lamda-Terms as Logic Programming (DM), pp. 255–269.
ICLP-1991-Hagiya #higher-order #proving #theorem proving #unification
Higher-Order Unification as a Theorem Proving Procedure (MH), pp. 270–284.
ICLP-1991-ChengRS #metaprogramming #prolog
Higher Level Meta Programming in Qu-Prolog 3: 0 (ASKC, PJR, JS), pp. 285–298.
ICLP-1991-VerschaetseS #logic programming #proving #source code #termination #using
Deriving Termination Proofs for Logic Programs, Using Abstract Procedures (KV, DDS), pp. 301–315.
ICLP-1991-RossS #algebra #prolog #semantics #termination
An Algebraic Semantics of Prolog Program Termination (BJR, AS), pp. 316–330.
ICLP-1991-CodishFM #analysis #concurrent #logic programming #source code
Suspension Analysis for Concurrent Logic Programs (MC, MF, KM), pp. 331–345.
ICLP-1991-MoscowitzS #logic programming #source code
Lexical Logic Programs (YM, EYS), pp. 349–363.
ICLP-1991-MansfieldTMN #approach #named #towards
AMLOG-E: A New Approach towards Amalgamation (GM, AT, NM, SN), pp. 364–378.
ICLP-1991-YardeniFS #logic programming #source code
Polymorphically Typed Logic Programs (EY, TWF, EYS), pp. 379–393.
ICLP-1991-Turi #logic programming #source code
Extending S-Models to Logic Programs with Negation (DT), pp. 397–411.
ICLP-1991-HuY #logic programming #semantics #source code
Extended Well-Founded Model Semantics for General Logic Programs (YH, LYY), pp. 412–425.
ICLP-1991-PalmerN #named #parallel #prolog
NUA-Prolog: An Extension to the WAM for Parallel Andorra (DP, LN), pp. 429–442.
ICLP-1991-CostaWY #preprocessor #prolog
The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model (VSC, DHDW, RY), pp. 443–456.
ICLP-1991-KorslootT #compilation #concurrent #logic programming #programming language
Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages (MK, ET), pp. 457–471.
ICLP-1991-PereiraAA #reasoning #semantics
Nonmonotonic Reasoning with Well Founded Semantics (LMP, JNA, JJA), pp. 475–489.
ICLP-1991-Inoue #logic programming #source code
Extended Logic Programs with Default Assumptions (KI), pp. 490–504.
ICLP-1991-SatohI #abduction #using
Computing Abduction by Using the TMS (KS, NI), pp. 505–518.
ICLP-1991-Yap #strict
Restriction Site Mapping in CLP(R) (RHCY), pp. 521–534.
ICLP-1991-FujitaH #algorithm #generative #proving #theorem proving #using
A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm (HF, RH), pp. 535–548.
ICLP-1991-Reintjes #design #set #tool support
A Set of Tools for VHDL Design (PBR), pp. 549–562.
ICLP-1991-NgS #database #deduction #framework #semantics
A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases (RTN, VSS), pp. 565–580.
ICLP-1991-DuboisLP #logic programming #towards
Towards Possibilistic Logic Programming (DD, JL, HP), pp. 581–595.
ICLP-1991-DebrayL #analysis #automation #complexity #logic programming #source code
Automatic Complexity Analysis of Logic Programs (SKD, NWL), pp. 599–613.
ICLP-1991-Lever #proving
Proving Program Properties by Means of SLS-Resolution (JML), pp. 614–628.
ICLP-1991-ColussiM #axiom #correctness #logic programming #proving #semantics #source code #using
Proving Correctness of Logic Programs Using Axiomatic Semantics (LC, EM), pp. 629–642.
ICLP-1991-BachmairG #logic programming #semantics #similarity #source code
Perfect Model Semantics for Logic Programs with Equality (LB, HG), pp. 645–659.
ICLP-1991-FernandezM #bottom-up #database #deduction #evaluation
Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases (JAF, JM), pp. 660–675.
ICLP-1991-KoN #revisited
Substitution and Refutation Revisited (HPK, MEN), pp. 679–692.
ICLP-1991-Decker #axiom #on the
On Generalized Cover Axioms (HD), pp. 693–707.
ICLP-1991-Harland #logic programming #source code
A Clausal Form for the Completion of Logic Programs (JH), pp. 711–725.
ICLP-1991-Przymusinski #logic programming #source code
Well-Founded Completions of Logic Programs (TCP), pp. 726–741.
ICLP-1991-HentenryckD #constraints #logic #logic programming
The Cardinality Operator: A New Logical Connective for Constraint Logic Programming (PVH, YD), pp. 745–759.
ICLP-1991-Smith #constraints
Constraint Operations for CLP(FT) (DAS), pp. 760–774.
ICLP-1991-AggounB #compilation #overview
Overview of the CHIP Compiler System (AA, NB), pp. 775–789.
ICLP-1991-Mudambi
Performances of Aurora on NUMA Machines (SM), pp. 793–806.
ICLP-1991-AliK #scheduling
Scheduling Or-Parallelism in Muse (KAMA, RK), pp. 807–821.
ICLP-1991-CostaWY91a #implementation #parallel
The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model (VSC, DHDW, RY), pp. 825–839.
ICLP-1991-HarsatG #named
CARMEL-4: The Unify-Spawn Machine for FCP (AH, RG), pp. 840–854.
ICLP-1991-BrissetR #linear
Naïve Reverse Can be Linear (PB, OR), pp. 857–870.
ICLP-1991-JayaramanN #implementation #logic programming
Implementation Techniques for Scoping Constructs in Logic Programming (BJ, GN), pp. 871–886.
ICLP-1991-Bottcher #logic programming #on the #programming language #transaction
On Transactions in Logic Programming Languages (SB), p. 889.
ICLP-1991-MigaultRC #prolog
Prolog as a Host Language (BM, FR, LC), p. 890.
ICLP-1991-PuchhammerS #automaton #design #prototype
A Rule-oriented FSM Design System with Prototyping Capabilities (MP, RS), p. 891.
ICLP-1991-WatanabeK #layout #parallel #problem
Co-operative Hierarchical Layout Problem Solver on Parallel Inference Machine (TW, KK), p. 892.
ICLP-1991-BallanceG #consistency #incremental #interactive #maintenance
Incremental Consistency Maintenance for Interactive Applications (RAB, SLG), pp. 895–909.
ICLP-1991-Kowalski #logic programming #source code
Legislation as Logic Programs (RAK), p. 910.
ICLP-1991-Miller91a #logic #logic programming #tutorial
Logics for Logic Programming: A Tutorial (DM), p. 911.
ICLP-1991-Robinet #logic programming
Logic Programming at IBM: From the Lab to the Customer (BR), pp. 912–921.
ICLP-1991-Scowen #overview #problem #prolog #standard
An Overview of Prolog Standardization — Progress, Problems and Solutions (RSS), pp. 922–936.
ICLP-1991-Ait-Kaci #automaton
Warren’s Abstract Machine (HAK), p. 939.
ICLP-1991-Cousot #abstract interpretation #logic programming #source code
Abstract Interpretation of Logic Programs (PC), p. 940.
ICLP-1991-DevilleSD #development #logic programming
Software Development and Logic Programming (YD, LS, PD), p. 941.
ICLP-1991-Ferrand #concept #logic programming #prolog
Basic Concepts of Logic Programming and Prolog (GF), p. 942.
ICLP-1991-Haridi #logic programming #parallel #principle
Parallel Logic Programming based on the Andorra Principle (SH), p. 943.
ICLP-1991-ChabrierPL #constraints #logic programming #programming language
Applications of Constraints Logic Programming Languages (JJC, CP, BL), p. 944.
ICLP-1991-Levi #logic programming #on the #semantics #source code
On the Semantics of Logic Programs (GL), p. 945.
ICLP-1991-Porto #logic programming
Logic Programming Environments (AP), p. 946.
ICLP-1991-Saint-Dizier #logic programming
Logic Programming for Language Processing (PSD), p. 947.
ICLP-1991-Sato #first-order #logic programming
Full First Order Logic Programming and Truth Predicate (TS), p. 948.
ICLP-1991-Taki #parallel #programming #scalability
Parallel Programming and Large-scale Applications in the FGCS Project (KT), p. 949.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.