A logical reconstruction of Prolog II

DOI10.1016/0743-1066(84)90001-3zbMath0594.68033OpenAlexW2019695296MaRDI QIDQ3725539

Maarten H. Van Emden, John W. Lloyd

Publication date: 1984

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(84)90001-3

zbMATH Keywords

logic programming languagetree rewritingProlog II

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items (10)

Computation of full logic programs using one-variable environments ⋮ Incorporating equality into logic programming via surface deduction ⋮ Semantics of infinite tree logic programming ⋮ Algèbres effectives dans la programmation logique avec contraintes ⋮ Fifty Years of Prolog and Beyond ⋮ Semantics for logic programs without occur check ⋮ Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach ⋮ Logic and linguistics meeting, Stanford, 1987 ⋮ Equality and abductive residua for Horn clauses ⋮ C-expressions: A variable-free calculus for equational logic programming

This page was built for publication: A logical reconstruction of Prolog II