8. ICLP 1991: Paris, France

Theory I

• Phan Minh Dung: Negations as Hypotheses: An Abductive Foundation for Logic Programming. 3-17
• Marco A. Casanova, Andrea S. Hemerly, Ramiro A. de T. Guerreiro: Explaining SLDNF Resolution with Non-Normal Defaults. 18-31
• Alessandra Di Pierro, Maurizio Martelli, Catuscia Palamidessi: Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming. 32-45

Program Analysis

• Kalyan Muthukumar, Manuel V. Hermenegildo: Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation. 49-63
• Baudouin Le Charlier, Kaninda Musumbu, Pascal Van Hentenryck: A Generic Abstract Interpretation Algorithm and its Complexity Analysis. 64-78
• Michael Codish, Dennis Dams, Eyal Yardeni: Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. 79-93

High Order I

• Weidong Chen, David Scott Warren: An Intensional Logic of (Multi-Arity) Set Abstractions. 97-110
• Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi: {log}: A Logic Programming Language with Finite Sets. 111-124

Implementation I

• Philippe Codognet, Thierry Sola: Extending the WAM for Intelligent Backtracking. 127-141
• Ludek Matyska, Adriana Jergová, David Toman: Register Allocation in WAM. 142-156
• Micha Meier: Recursion versus Iteration in Prolog. 157-169

Application I

• Eugene J. Rollins, Jeannette M. Wing: Specifications as Search Keys for Software Libraries. 173-187
• Jean-François Monin: Real-size Compiler Writing Using Prolog with Arrows. 188-201
• Bruno Marre: Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming. 202-219

Constraints I

• Ugo Montanari, Francesca Rossi: Perfect Relaxation in Constraint Logic Programming. 223-237
• Maurizio Gabbrielli, Giorgio Levi: Modeling Answer Constraints in Constraint Logic Programs. 238-252

High Order II

• Dale Miller: Unification of Simply Typed Lamda-Terms as Logic Programming. 255-269
• Masami Hagiya: Higher-Order Unification as a Theorem Proving Procedure. 270-284
• Anthony S. K. Cheng, Peter J. Robinson, John Staples: Higher Level Meta Programming in Qu-Prolog 3: 0. 285-298

Program Analysis II

• Kristof Verschaetse, Danny De Schreye: Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. 301-315
• Brian J. Ross, Alan Smaill: An Algebraic Semantics of Prolog Program Termination. 316-330
• Michael Codish, Moreno Falaschi, Kim Marriott: Suspension Analysis for Concurrent Logic Programs. 331-345

Extensions of LP

• Yael Moscowitz, Ehud Y. Shapiro: Lexical Logic Programs. 349-363
• Glenn Mansfield, Atsushi Togashi, Nobuhisa Miake, Shoichi Noguchi: AMLOG-E: A New Approach towards Amalgamation. 364-378
• Eyal Yardeni, Thom W. Frühwirth, Ehud Y. Shapiro: Polymorphically Typed Logic Programs. 379-393

Theory II

• Daniele Turi: Extending S-Models to Logic Programs with Negation. 397-411
• Yong Hu, Li-Yan Yuan: Extended Well-Founded Model Semantics for General Logic Programs. 412-425

Implementation II

• Doug Palmer, Lee Naish: NUA-Prolog: An Extension to the WAM for Parallel Andorra. 429-442
• Vítor Santos Costa, David H. D. Warren, Rong Yang: The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model. 443-456
• Mark Korsloot, Evan Tick: Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages. 457-471

Abduction

• Luís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes: Nonmonotonic Reasoning with Well Founded Semantics. 475-489
• Katsumi Inoue: Extended Logic Programs with Default Assumptions. 490-504
• Ken Satoh, Noboru Iwayama: Computing Abduction by Using the TMS. 505-518

Application II

• Roland H. C. Yap: Restriction Site Mapping in CLP(R). 521-534
• Hiroshi Fujita, Ryuzo Hasegawa: A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm. 535-548
• Peter B. Reintjes: A Set of Tools for VHDL Design. 549-562

Uncertainty

• Raymond T. Ng, V. S. Subrahmanian: A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases. 565-580
• Didier Dubois, Jérôme Lang, Henri Prade: Towards Possibilistic Logic Programming. 581-595

Program Analysis III

• Saumya K. Debray, Nai-Wei Lin: Automatic Complexity Analysis of Logic Programs. 599-613
• Jonathan M. Lever: Proving Program Properties by Means of SLS-Resolution. 614-628
• Livio Colussi, Elena Marchiori: Proving Correctness of Logic Programs Using Axiomatic Semantics. 629-642

Theory III

• Leo Bachmair, Harald Ganzinger: Perfect Model Semantics for Logic Programs with Equality. 645-659
• José Alberto Fernández, Jack Minker: Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases. 660-675

Theory IV

• Hai-Ping Ko, Mark E. Nadel: Substitution and Refutation Revisited. 679-692
• Hendrik Decker: On Generalized Cover Axioms. 693-707

Theory V

• James Harland: A Clausal Form for the Completion of Logic Programs. 711-725
• Teodor C. Przymusinski: Well-Founded Completions of Logic Programs. 726-741

Constraints II

• Pascal Van Hentenryck, Yves Deville: The Cardinality Operator: A New Logical Connective for Constraint Logic Programming. 745-759
• Donald A. Smith: Constraint Operations for CLP(FT). 760-774
• Abderrahmane Aggoun, Nicolas Beldiceanu: Overview of the CHIP Compiler System. 775-789

Implementation III

• Shyam Mudambi: Performances of Aurora on NUMA Machines. 793-806
• Khayri A. M. Ali, Roland Karlsson: Scheduling Or-Parallelism in Muse. 807-821

Implementation IV

• Vítor Santos Costa, David H. D. Warren, Rong Yang: The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model. 825-839
• Arie Harsat, Ran Ginosar: CARMEL-4: The Unify-Spawn Machine for FCP. 840-854

Implementation V

• Pascal Brisset, Olivier Ridoux: Naïve Reverse Can be Linear. 857-870
• Bharat Jayaraman, Gopalan Nadathur: Implementation Techniques for Scoping Constructs in Logic Programming. 871-886

Abstracts of Poster Sessions

• Stefan Böttcher: On Transactions in Logic Programming Languages. 889
• Bernard Migault, François Rousselot, Laurent Cervoni: Prolog as a Host Language. 890
• M. Puchhammer, R. Schlöglhofer: A Rule-oriented FSM Design System with Prototyping Capabilities. 891
• Toshinori Watanabe, Keiko Komatsu: Co-operative Hierarchical Layout Problem Solver on Parallel Inference Machine. 892

Abstracts of Invited Talks

• Robert A. Ballance, Susan L. Graham: Incremental Consistency Maintenance for Interactive Applications. 895-909
• Robert A. Kowalski: Legislation as Logic Programs. 910
• Dale Miller: Logics for Logic Programming: A Tutorial. 911
• Bernard Robinet: Logic Programming at IBM: From the Lab to the Customer. 912-921
• R. S. Scowen: An Overview of Prolog Standardization - Progress, Problems and Solutions. 922-936

Abstracts of Advanced Tutorials

• Hassan Aït-Kaci: Warren's Abstract Machine. 939
• Patrick Cousot: Abstract Interpretation of Logic Programs. 940
• Yves Deville, Leon Sterling, Pierre Deransart: Software Development and Logic Programming. 941
• Gérard Ferrand: Basic Concepts of Logic Programming and Prolog. 942
• Seif Haridi: Parallel Logic Programming based on the Andorra Principle. 943
• Jean-Jacques Chabrier, Claudine Pradelles, Bruno Legeard: Applications of Constraints Logic Programming Languages. 944
• Giorgio Levi: On the Semantics of Logic Programs. 945
• António Porto: Logic Programming Environments. 946
• Patrick Saint-Dizier: Logic Programming for Language Processing. 947
• Taisuke Sato: Full First Order Logic Programming and Truth Predicate. 948
• Kazuo Taki: Parallel Programming and Large-scale Applications in the FGCS Project. 949

Last update Fri May 24 02:58:40 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page