Algebraic and Logic Programming: Second International Conference, Nancy, France, October 1-3, 1990. ProceedingsThis volume consists of papers presented at the Second International Conference on Algebraic and Logic Programming in Nancy, France, October 1-3, 1990. |
Contents
Proving and Rewriting | 1 |
Proving correctness wrt specifications with hidden parts | 25 |
Hybrid implementations of algebraic specifications | 40 |
MULTIMODAL LOGIC PROGRAMMING USING EQUATIONAL AND ORDERSORTED LOGIC | 55 |
Extended Abstract | 70 |
HigherOrder OrderSorted Algebras | 86 |
Axiomatization of a Functional Logic Language | 101 |
Fourier Algorithm Revisited | 117 |
ELIMINATING NEGATION FROM NORMAL LOGIC PROGRAMS | 217 |
Programming LongDistance Dependencies in Logic | 232 |
RECURSIVE QUERY PROCESSING IN PREDICATEGOAL GRAPH | 247 |
ORME | 262 |
Products | 270 |
Equation Solving in Conditional ACTheories | 283 |
Lazy Narrowing in a Graph Machine | 298 |
An Abstract Concurrent Machine for Rewriting | 318 |
Fixpoint Techniques for NonMonotone Maps | 132 |
Domain Theory for Nonmonotonic Functions | 144 |
On the strong completion of logic programs | 158 |
An Equivalence Preserving First Order Unfoldfold Transformation System | 173 |
Prepositional Calculus Problems in CHIP | 189 |
Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs | 204 |
Applying Term Rewriting Methods to Finite Groups | 332 |
Termination proofs by multiset path orderings imply primitive recursive derivation lengths | 347 |
Optimization of Rewriting and Complexity of Rewriting | 359 |
A Modified KnuthBendix Ordering | 372 |
Other editions - View all
Algebraic and Logic Programming: Second International Conference, Nancy ... Helene Kirchner,Wolfgang Wechler No preview available - 1990 |
Algebraic and Logic Programming: Second International Conference, Nancy ... Helene Kirchner,Wolfgang Wechler No preview available - 2014 |
Common terms and phrases
algorithm applied argument atoms axioms backtracking boolean canonical term rewriting completion Computer Science consider constant Constraint Logic Programming constraints constructor critical pairs deduction defined definite clause denoted derivation Dislog clause domain equations equivalence evaluation example exists expression finite fixpoint formula function symbol given goal ground terms Herbrand Herbrand universe higher-order Horn clauses implementation induction interpretation Joseph Goguen KBOS Knuth-Bendix least fixpoint lemma linear Logic Programming matching monotonic multiset natural numbers negated node normal form operational semantics operator order-sorted P-G graph polymorphic predicate problem Proc programming language Prolog prove query recursive redex relation restriction rewrite rules satisfies semantics semantics of logic signature solution solve sort stable model strategy stratified subgraph subterm T-unifiers t₁ term rewriting system termination Theorem theory three-valued transformation rule type structure typed logic typed variables well-founded well-founded semantics