LEADER 03995nam  22006135  450 
001 996465868903316
005 20200705064136.0
010   $a3-540-46738-6
024 7 $a10.1007/3-540-53162-9
035   $a(CKB)1000000000233574
035   $a(SSID)ssj0000321090
035   $a(PQKBManifestationID)11260279
035   $a(PQKBTitleCode)TC0000321090
035   $a(PQKBWorkID)10262837
035   $a(PQKB)10405101
035   $a(DE-He213)978-3-540-46738-0
035   $a(PPN)155204181
035   $a(EXLCZ)991000000000233574
100   $a20121227d1990      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAlgebraic and Logic Programming$b[electronic resource] $eSecond International Conference, Nancy, France, October 1-3, 1990. Proceedings /$fedited by Helene Kirchner, Wolfgang Wechler
205   $a1st ed. 1990.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1990.
215   $a1 online resource (IX, 389 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v463
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-53162-9 
327   $aProving 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v463
606   $aSoftware engineering
606   $aArtificial intelligence
606   $aMathematical logic
606   $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
615  0$aSoftware engineering.
615  0$aArtificial intelligence.
615  0$aMathematical logic.
615 14$aSoftware Engineering/Programming and Operating Systems.
615 24$aArtificial Intelligence.
615 24$aMathematical Logic and Formal Languages.
615 24$aSoftware Engineering.
676   $a005.1
702   $aKirchner$b Helene$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aWechler$b Wolfgang$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465868903316
996   $aAlgebraic and logic programming$91492537
997   $aUNISA