03995nam 22006135 450 99646586890331620200705064136.03-540-46738-610.1007/3-540-53162-9(CKB)1000000000233574(SSID)ssj0000321090(PQKBManifestationID)11260279(PQKBTitleCode)TC0000321090(PQKBWorkID)10262837(PQKB)10405101(DE-He213)978-3-540-46738-0(PPN)155204181(EXLCZ)99100000000023357420121227d1990 u| 0engurnn|008mamaatxtccrAlgebraic and Logic Programming[electronic resource] Second International Conference, Nancy, France, October 1-3, 1990. Proceedings /edited by Helene Kirchner, Wolfgang Wechler1st ed. 1990.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1990.1 online resource (IX, 389 p.) Lecture Notes in Computer Science,0302-9743 ;463Bibliographic Level Mode of Issuance: Monograph3-540-53162-9 Proving and rewriting -- Proving correctness w.r.t. specifications with hidden parts -- Hybrid implementations of algebraic specifications -- Multi-modal logic programming using equational and order-sorted logic -- Logic programs with equational type specifications -- Higher-order order-sorted algebras -- Axiomatization of a functional logic language -- Fourier algorithm revisited -- Fixpoint techniques for non-monotone maps -- Domain theory for nonmonotonic functions -- On the strong completion of logic programs -- An equivalence preserving first order unfold/fold transformation system -- Propositional calculus problems in CHIP -- Unfolding and fixpoint semantics of concurrent constraint logic programs -- Eliminating negation from normal logic programs -- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic -- Recursive query processing in predicate-goal graph -- Implementation of completion by transition rules + control: ORME -- A matching process modulo a theory of categorical products -- Equation solving in conditional AC-theories -- Lazy narrowing in a graph machine -- An abstract concurrent machine for rewriting -- Applying term rewriting methods to finite groups -- Termination proofs by multiset path orderings imply primitive recursive derivation lengths -- Optimization of rewriting and complexity of rewriting -- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering.Lecture Notes in Computer Science,0302-9743 ;463Software engineeringArtificial intelligenceMathematical logicSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Software Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Software engineering.Artificial intelligence.Mathematical logic.Software Engineering/Programming and Operating Systems.Artificial Intelligence.Mathematical Logic and Formal Languages.Software Engineering.005.1Kirchner Heleneedthttp://id.loc.gov/vocabulary/relators/edtWechler Wolfgangedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465868903316Algebraic and logic programming1492537UNISA