|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465868903316 |
|
|
Titolo |
Algebraic and Logic Programming [[electronic resource] ] : Second International Conference, Nancy, France, October 1-3, 1990. Proceedings / / edited by Helene Kirchner, Wolfgang Wechler |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1990.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (IX, 389 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 463 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Software engineering |
Artificial intelligence |
Mathematical logic |
Software Engineering/Programming and Operating Systems |
Artificial Intelligence |
Mathematical Logic and Formal Languages |
Software Engineering |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
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 |
|
|
|
|