A logical reconstruction of Prolog II

DOI10.1016/0743-1066(84)90001-3MaRDI QIDQ3725539zbMATH OpenOpenAlexFDO

Authors M. 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 languageProlog IItree rewriting

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4072431
• scientific article; zbMATH DE number 3980452
• scientific article; zbMATH DE number 3999250
• A mathematical definition of full Prolog
• scientific article; zbMATH DE number 4076677

Cited in

(12)

• Computation of full logic programs using one-variable environments
• Incorporating equality into logic programming via surface deduction
• Semantics of infinite tree logic programming
• C-expressions: A variable-free calculus for equational logic programming
• Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach
• scientific article; zbMATH DE number 3943013 (Why is no real title available?)
• Logic and linguistics meeting, Stanford, 1987
• Algèbres effectives dans la programmation logique avec contraintes
• scientific article; zbMATH DE number 1746028 (Why is no real title available?)
• Fifty Years of Prolog and Beyond
• Equality and abductive residua for Horn clauses
• Semantics for logic programs without occur check

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725539)