scientific article
From MaRDI portal
Publication:3789064
zbMath0645.68046MaRDI QIDQ3789064
Jean-Louis Lassez, Michael J. Maher, Kim Marriott
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Logic of proofs ⋮ Computing definite logic programs by partial instantiation ⋮ The role of standardising apart in logic programming ⋮ Evolution of rule-based programs ⋮ A New Algorithm for Computing Least Generalization of a Set of Atoms ⋮ Linearisability on Datalog programs ⋮ Typed Relational Conversion ⋮ Most specific logic programs ⋮ On fuzzy unfolding: A multi-adjoint approach ⋮ Category-based modularisation for equational logic programming ⋮ Generalizing DPLL and satisfiability for equalities ⋮ Incremental constraint satisfaction for equational logic programming ⋮ A geometric interpretation of LD-resolution ⋮ On the transformation of logic programs with instantiation based computation rules ⋮ On inductive inference of cyclic structures ⋮ Syntactical models and fixed points for the basic logic of proofs ⋮ The quotient of an abstract interpretation ⋮ First order compiler: A deterministic logic program synthesis algorithm ⋮ A modular order-sorted equational generalization algorithm ⋮ Reverse universal resolving algorithm and inverse driving ⋮ Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets ⋮ The powerset operator on abstract interpretations ⋮ Semantic models for concurrent logic languages ⋮ A canonical form for generalized linear constraints ⋮ A compositional semantic basis for the analysis of equational Horn programs ⋮ Transformations of CLP modules ⋮ A non-ground realization of the stable and well-founded semantics ⋮ Computing minimal models by partial instantiation ⋮ A complete and recursive feature theory ⋮ Intensional aspects of function definitions ⋮ Multi-valued logic programming semantics An algebraic approach ⋮ Abstract interpretation: a kind of magic ⋮ A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses ⋮ Difference-list transformation for Prolog ⋮ Complete axiomatizations of some quotient term algebras ⋮ Average-case analysis of unification algorithms ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete ⋮ Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding ⋮ Proximity-based unification theory ⋮ C-expressions: A variable-free calculus for equational logic programming ⋮ Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses ⋮ On deciding subsumption problems ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Theories with the independence property ⋮ A Modular Equational Generalization Algorithm ⋮ Debugging Maude programs via runtime assertion checking and trace slicing ⋮ Symbolic Unfolding of Multi-adjoint Logic Programs ⋮ Proving quantified literals in defeasible logic ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ Compositionality properties of SLD-derivations ⋮ Order-Sorted Generalization ⋮ The reduced relative power operation on abstract domains ⋮ An improved reductant calculus using fuzzy partial evaluation techniques ⋮ Syntactic Unification as a Geometric Operation in Free Modules over certain Rings ⋮ Context unification with one context variable ⋮ Explicit versus implicit representations of subsets of the Herbrand universe. ⋮ Efficient Reductants Calculi using Partial Evaluation Techniques with Thresholding ⋮ A compositional semantics for logic programs ⋮ Sound and complete partial deduction with unfolding based on well-founded measures ⋮ A feature constraint system for logic programming with entailment ⋮ Logic program synthesis from incomplete specifications
