Recursion equation sets computing logic programs

DOI10.1016/0304-3975(90)90023-BzbMath0708.68035MaRDI QIDQ920624

Susumu Yamasaki

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

logic programsleast fixed pointHerbrand domainHorn-logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

A denotational semantics and dataflow construction for logic programs

Cites Work

• Closures and fairness in the semantics of programming logic
• Optimal fixedpoints of logic programs
• A fixpoint semantics of Horn sentences based on substitution sets
• A deterministic prolog fixpoint semantics
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• Lucid—A Formal System for Writing and Proving Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item