Algebraic and logic programming. Second international conference, Nancy, France, October 1--3, 1990. Proceedings (Q1188886)

From the Editors' Foreword: ''Following the intention of the 1st symposium, held in Gaussig in November 1988, this conference aims at strengthening the connections between algebraic approaches and logic programming. On one hand, logic programming has been very succesful during the last decades and more and more systems compete in enhancing its expressive power. On the other hand, concepts like functions, equality theory and modularity are particularly well-handled in an algebraic framework. Common foundations of both approaches have recently been developed and this conference is intended to be a place where people from both areas can exchange their ideas, results and experiences and make interesting progress. ... The scientific program mainly covers the following topics: --- Semantics of algebraic and logic programming --- Term rewriting, narrowing, resolution --- Constraint logic programming --- Concurrent features in algebraic and logic programming languages --- Implementation issues (with possible system demonstrations)'' Contents: Proving and rewriting J.A. Goguen (U Oxford, UK) Proving correctness w.r.t. specifications with hidden parts J. Farrès-Casals (U Edinburgh, UK) Hybrid implementations of algebraic specifications H.R. Walters (U Amsterdam, The Netherlands) Multi-modal logic programming using equational and order-sorted logic F. Debart, P. Enjalbert, M. Lescot (U Cean, France) Logic programs with equational type specifications (ext. abst.) M. Hanus (U Dortmund, FRG) Higher-order order-sorted algebra Z. Qian (U Bremen, FRG) Axiomatization of a functional logic language F. Bronsard, U.S. Reddy (U Illinois, USA) Fourier algorithm revisited T. Huynh, C. Lassez, J-L. Lassez (IBM Yorktown, USA) Fixpoint techniques for non-monotone maps A. Batarekh (Concordia U, Canada) Domain theory for nonmonotonic functions Y. Zhou, R. Muller (Harvard U, USA) On the strong completion of logic programs Phan Minh Dung (AIT Bangkok, Thailand) An equivalence preserving first order unfold/fold transformation system T. Sato (EL Ibaraki, Japan) propositional calculus problems in CHIP H. Simonis, M. Dincbas (ECRC München, FRG) Unfolding and fixpoint semantics of concurrent constraint logic programs M. Gabrielli, G. Levi (U Pisa, Italy) Eliminating negation from normal logic programs K. Kanchanasut, P. Stuckey (U Melbourne, Australia) On logic programming interpretations of Dislog: Programming long-distance dependencies in logic P. Saint-Dizier (U Toulouse, France) Recursive query processing in predicate-goal graph Jia Liang Han (UCS Queensland, Australia) Implementation of completion by transition rules + control: ORME P. Lescanne (CRIN-INRIA-Lorraine, France) A matching process modulo a theory of categorical products F. Bellegarde (OGIST Beaverton, USA) Equation solving in conditional AC-theories N. Dershowitz (U Illinois, USA), S. Mitra, G. Sivakumar (U Delaware, USA) Lazy narrowing in a graph machine J.J.M. Rodríguez-Arteljo (UC Madrid, Spain) An abstract concurrent machine for rewriting N. Dershowitz (U Illinois, USA), N. Lindenstrauss (Hebrew U, Israel) Applying term rewriting methods to finite groups R. Bündgen (U Tübingen, FRG) Termination proofs by multiset path orderings imply primitive recursive derivation lengths D. Hofbauer (TU Berlin, FRG) Optimization of rewriting and complexity of rewriting Ke Li (U New York, USA) AC-Termination of rewrite systems: a modified Knuth-Bendix ordering J. Steinbach (U Kaiserslautern, FRG). The articles of this volume will be reviewed individually. Indexed articles: \textit{Goguen, Joseph A.}, Proving and rewriting, 1-24 [Zbl 1496.03045] \textit{Farrés-Casals, Jordi}, Proving correctness w.r.t. specifications with hidden parts, 25-39 [Zbl 1493.68228] \textit{Walters, H. R.}, Hybrid implementations of algebraic specifications, 40-54 [Zbl 1495.68143] \textit{Debart, Françoise; Enjalbert, Patrice; Lescot, Madeleine}, Multi-modal logic programming using equational and order-sorted logic, 55-69 [Zbl 1494.68041] \textit{Hanus, Michael}, Logic programs with equational type specifications (extended abstract), 70-85 [Zbl 1493.68070] \textit{Qian, Zhenyu}, Higher-order order-sorted algebras, 86-100 [Zbl 1493.68093] \textit{Bronsard, Francois; Reddy, Uday S.}, Axiomatization of a functional logic language, 101-116 [Zbl 1493.68055] \textit{Huynh, Tien; Lassez, Catherine; Lassez, Jean-Louis}, Fourier algorithm revisited, 117-131 [Zbl 1493.68401] \textit{Batarekh, Aïda}, Fixpoint techniques for non-monotone maps, 132-143 [Zbl 1493.68065] \textit{Zhou, Yuli; Muller, Robert}, Domain theory for nonmonotonic functions, 144-157 [Zbl 1493.68078] \textit{Phan Minh Dung}, On the strong completion of logic programs, 158-172 [Zbl 1493.68073] \textit{Sato, Taisuke}, An equivalence preserving first order unfold/fold transformation system, 173-188 [Zbl 1493.68076] \textit{Simonis, H.; Dincbas, M.}, Propositional calculus problems in CHIP, 189-203 [Zbl 1493.68077] \textit{Gabbrielli, Maurizio; Levi, Giorgio}, Unfolding and fixpoint semantics of concurrent constraint logic programs, 204-216 [Zbl 1493.68068] \textit{Kanchanasut, Kanchana; Stuckey, Peter}, Eliminating negation from normal logic programs, 217-231 [Zbl 1493.68071] \textit{Saint-Dizier, Patrick}, On logic programming interpretations of Dislog: programming long-distance dependencies in logic, 232-246 [Zbl 1493.68075] \textit{Han, Jia Liang}, Recursive query processing in predicate-goal graph, 247-261 [Zbl 1493.68132] \textit{Bellegarde, Françoise}, A matching process modulo a theory of categorical products, 270-282 [Zbl 1493.68100] \textit{Dershowitz, Nachum; Mitra, Subrata; Sivakumar, G.}, Equation solving in conditional AC-theories, 283-297 [Zbl 1493.68105] \textit{Moreno-Navarro, Juan José; Kuchen, Herbert; Loogen, Rita; Rodríguez-Artalejo, Mario}, Lazy narrowing in a graph machine, 298-317 [Zbl 1493.68059] \textit{Dershowitz, Nachum; Lindenstrauss, Naomi}, An abstract concurrent machine for rewriting, 318-331 [Zbl 1493.68173] \textit{Bündgen, Reinhard}, Applying term rewriting methods to finite groups, 332-346 [Zbl 1493.68171] \textit{Hofbauer, Dieter}, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, 347-358 [Zbl 1494.68111] \textit{Li, Ke}, Optimization of rewriting and complexity of rewriting, 359-371 [Zbl 1493.68175] \textit{Steinbach, Joachim}, AC-termination of rewrite systems: a modified Knuth-Bendix ordering, 372-386 [Zbl 1493.68179]