scientific article
From MaRDI portal
Publication:3716279
zbMath0588.68005MaRDI QIDQ3716279
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
logic programmingfunctional programmingHASLAPPLOGEQLOGFRESHFUNLOGLEAFPROLOG-WITH-EQUALITYQUTETABLOGUNICORNUNIFORM
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in the theory of software (68N01)
Related Items (51)
A resolution principle for constrained logics ⋮ FPL : Functional plus logic programming an integration of the FP and Prolog languages ⋮ Confluence of the disjoint union of conditional term rewriting systems ⋮ Hybrid reasoning using universal attachment ⋮ Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction ⋮ Negation with logical variables in conditional rewriting ⋮ Optimization by non-deterministic, lazy rewriting ⋮ Narrowing directed by a graph of terms ⋮ Quasi-Boolean encodings and conditionals in algebraic specification ⋮ Algebraic programming: Methods and tools ⋮ Logic programming with external procedures: Introducing S-unification ⋮ CoLab: A hybrid knowledge representation and compilation laboratory ⋮ Kernel-LEAF: A logic plus functional language ⋮ Unification modulo an equality theory for equational logic programming ⋮ Category-based modularisation for equational logic programming ⋮ Geometry of torsion ⋮ Incremental constraint satisfaction for equational logic programming ⋮ Inheritance hierarchies: Semantics and unifications ⋮ Enumerating outer narrowing derivations for constructor-based term rewriting systems ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ A new generic scheme for functional logic programming with constraints ⋮ Programming in metric temporal logic ⋮ Two Decades of Maude ⋮ Equation solving in conditional AC-theories ⋮ Lazy narrowing in a graph machine ⋮ May I borrow your logic? (Transporting logical structures along maps) ⋮ Order-sorted model theory for temporal executable specifications ⋮ CAL: A theoretical background of constraint logic programming and its applications ⋮ Declarative modeling of the operational behavior of logic languages ⋮ A rationale for conditional equational programming ⋮ Conditional equational theories and complete sets of transformations ⋮ Horn clause programs with polymorphic types: Semantics and resolution ⋮ Learning elementary formal systems ⋮ Dynamic detection of determinism in functional logic languages ⋮ Relating the implementation techniques of functional and functional logic languages ⋮ Why a single parallelization strategy is not enough in knowledge bases ⋮ C-expressions: A variable-free calculus for equational logic programming ⋮ A framework for computing finite SLD trees ⋮ Temporal logic programming ⋮ Programming and symbolic computation in Maude ⋮ Conditional narrowing modulo a set of equations ⋮ A relational approach to logic programming: The extended Alexander method ⋮ Objects in algebraic programming system ⋮ Preface ⋮ Functional-logic integration via minimal reciprocal extensions ⋮ On the algebraic structure of declarative programming languages ⋮ Relating CASL with other specification languages: the institution level. ⋮ Semantics of temporal classes ⋮ MLOG: A strongly typed confluent functional language with logical variables ⋮ A domain-theoretic approach to functional and logic programming ⋮ Accumulators: New logic variable abstractions for functional languages
Uses Software
This page was built for publication: