Vai al contenuto principale della pagina
Titolo: |
Algebraic and Logic Programming [[electronic resource] ] : Second International Conference, Nancy, France, October 1-3, 1990. Proceedings / / edited by Helene Kirchner, Wolfgang Wechler
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
Edizione: | 1st ed. 1990. |
Descrizione fisica: | 1 online resource (IX, 389 p.) |
Disciplina: | 005.1 |
Soggetto topico: | Software engineering |
Artificial intelligence | |
Mathematical logic | |
Software Engineering/Programming and Operating Systems | |
Artificial Intelligence | |
Mathematical Logic and Formal Languages | |
Software Engineering | |
Persona (resp. second.): | KirchnerHelene |
WechlerWolfgang | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di contenuto: | 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. |
Titolo autorizzato: | Algebraic and logic programming ![]() |
ISBN: | 3-540-46738-6 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465868903316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |