One binary Horn clause is enough

DOI10.1007/3-540-57785-8_128MaRDI QIDQ4942617zbMATH OpenFDO

Authors Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz

Publication date 16 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57785-8_128

zbMATH Keywords

computable functionconjunctive formulasdeclarative programmingequivalent of the Böhm-Jacopini theoremrecursive programsTuring machines

Mathematics Subject Classification ID

Logic in computer science (03B70) Turing machines and related notions (03D10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited in

(2)

• Thue trees
• Primal grammars and unification modulo a binary clause

This page was built for publication: One binary Horn clause is enough

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