ICLP B

77 papers

YearTitle / Authors
1991A Clausal Form for the Completion of Logic Programs.
James Harland
1991A Generic Abstract Interpretation Algorithm and its Complexity Analysis.
Baudouin Le Charlier, Kaninda Musumbu, Pascal Van Hentenryck
1991A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm.
Hiroshi Fujita, Ryuzo Hasegawa
1991A Rule-oriented FSM Design System with Prototyping Capabilities.
M. Puchhammer, R. Schlöglhofer
1991A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases.
Raymond T. Ng, V. S. Subrahmanian
1991A Set of Tools for VHDL Design.
Peter B. Reintjes
1991AMLOG-E: A New Approach towards Amalgamation.
Glenn Mansfield, Atsushi Togashi, Nobuhisa Miake, Shoichi Noguchi
1991Abstract Interpretation of Logic Programs.
Patrick Cousot
1991An Algebraic Semantics of Prolog Program Termination.
Brian J. Ross, Alan Smaill
1991An Intensional Logic of (Multi-Arity) Set Abstractions.
Weidong Chen, David Scott Warren
1991An Overview of Prolog Standardization - Progress, Problems and Solutions.
Roger S. Scowen
1991Applications of Constraints Logic Programming Languages.
Jean-Jacques Chabrier, Claudine Pradelles, Bruno Legeard
1991Automatic Complexity Analysis of Logic Programs.
Saumya K. Debray, Nai-Wei Lin
1991Basic Concepts of Logic Programming and Prolog.
Gérard Ferrand
1991Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases.
José Alberto Fernández, Jack Minker
1991CARMEL-4: The Unify-Spawn Machine for FCP.
Arie Harsat, Ran Ginosar
1991Co-operative Hierarchical Layout Problem Solver on Parallel Inference Machine.
Toshinori Watanabe, Keiko Komatsu
1991Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation.
Kalyan Muthukumar, Manuel V. Hermenegildo
1991Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages.
Mark Korsloot, Evan Tick
1991Computing Abduction by Using the TMS.
Ken Satoh, Noboru Iwayama
1991Constraint Operations for CLP(FT).
Donald A. Smith
1991Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis.
Michael Codish, Dennis Dams, Eyal Yardeni
1991Deriving Termination Proofs for Logic Programs, Using Abstract Procedures.
Kristof Verschaetse, Danny De Schreye
1991Explaining SLDNF Resolution with Non-Normal Defaults.
Marco A. Casanova, Andrea S. Hemerly, Ramiro A. de T. Guerreiro
1991Extended Logic Programs with Default Assumptions.
Katsumi Inoue
1991Extended Well-Founded Model Semantics for General Logic Programs.
Yong Hu, Li-Yan Yuan
1991Extending S-Models to Logic Programs with Negation.
Daniele Turi
1991Extending the WAM for Intelligent Backtracking.
Philippe Codognet, Thierry Sola
1991Full First Order Logic Programming and Truth Predicate.
Taisuke Sato
1991Higher Level Meta Programming in Qu-Prolog 3: 0.
Anthony S. K. Cheng, Peter J. Robinson, John Staples
1991Higher-Order Unification as a Theorem Proving Procedure.
Masami Hagiya
1991Implementation Techniques for Scoping Constructs in Logic Programming.
Bharat Jayaraman, Gopalan Nadathur
1991Incremental Consistency Maintenance for Interactive Applications.
Robert A. Ballance, Susan L. Graham
1991Legislation as Logic Programs.
Robert A. Kowalski
1991Lexical Logic Programs.
Yael Moscowitz, Ehud Shapiro
1991Logic Programming Environments.
António Porto
1991Logic Programming at IBM: From the Lab to the Customer.
Bernard J. Robinet
1991Logic Programming for Language Processing.
Patrick Saint-Dizier
1991Logic Programming, Proceedings of the Eigth International Conference, Paris, France, June 24-28, 1991
Koichi Furukawa
1991Logics for Logic Programming: A Tutorial.
Dale Miller
1991Modeling Answer Constraints in Constraint Logic Programs.
Maurizio Gabbrielli, Giorgio Levi
1991NUA-Prolog: An Extension to the WAM for Parallel Andorra.
Doug Palmer, Lee Naish
1991Naïve Reverse Can be Linear.
Pascal Brisset, Olivier Ridoux
1991Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming.
Alessandra Di Pierro, Maurizio Martelli, Catuscia Palamidessi
1991Negations as Hypotheses: An Abductive Foundation for Logic Programming.
Phan Minh Dung
1991Nonmonotonic Reasoning with Well Founded Semantics.
Luís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes
1991On Generalized Cover Axioms.
Hendrik Decker
1991On Transactions in Logic Programming Languages.
Stefan Böttcher
1991On the Semantics of Logic Programs.
Giorgio Levi
1991Overview of the CHIP Compiler System.
Abderrahmane Aggoun, Nicolas Beldiceanu
1991Parallel Logic Programming based on the Andorra Principle.
Seif Haridi
1991Parallel Programming and Large-scale Applications in the FGCS Project.
Kazuo Taki
1991Perfect Model Semantics for Logic Programs with Equality.
Leo Bachmair, Harald Ganzinger
1991Perfect Relaxation in Constraint Logic Programming.
Ugo Montanari, Francesca Rossi
1991Performances of Aurora on NUMA Machines.
Shyam Mudambi
1991Polymorphically Typed Logic Programs.
Eyal Yardeni, Thom W. Frühwirth, Ehud Shapiro
1991Prolog as a Host Language.
Bernard Migault, François Rousselot, Laurent Cervoni
1991Proving Correctness of Logic Programs Using Axiomatic Semantics.
Livio Colussi, Elena Marchiori
1991Proving Program Properties by Means of SLS-Resolution.
Jonathan M. Lever
1991Real-size Compiler Writing Using Prolog with Arrows.
Jean-François Monin
1991Recursion versus Iteration in Prolog.
Micha Meier
1991Register Allocation in WAM.
Ludek Matyska, Adriana Jergová, David Toman
1991Restriction Site Mapping in CLP(R).
Roland H. C. Yap
1991Scheduling Or-Parallelism in Muse.
Khayri A. M. Ali, Roland Karlsson
1991Software Development and Logic Programming.
Yves Deville, Leon Sterling, Pierre Deransart
1991Specifications as Search Keys for Software Libraries.
Eugene J. Rollins, Jeannette M. Wing
1991Substitution and Refutation Revisited.
Hai-Ping Ko, Mark E. Nadel
1991Suspension Analysis for Concurrent Logic Programs.
Michael Codish, Moreno Falaschi, Kim Marriott
1991The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model.
Vítor Santos Costa, David H. D. Warren, Rong Yang
1991The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model.
Vítor Santos Costa, David H. D. Warren, Rong Yang
1991The Cardinality Operator: A New Logical Connective for Constraint Logic Programming.
Pascal Van Hentenryck, Yves Deville
1991Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming.
Bruno Marre
1991Towards Possibilistic Logic Programming.
Didier Dubois, Jérôme Lang, Henri Prade
1991Unification of Simply Typed Lamda-Terms as Logic Programming.
Dale Miller
1991Warren's Abstract Machine.
Hassan Aït-Kaci
1991Well-Founded Completions of Logic Programs.
Teodor C. Przymusinski
1991{log}: A Logic Programming Language with Finite Sets.
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi