Optimal fixedpoints of logic programs

DOI10.1016/0304-3975(85)90128-8MaRDI QIDQ1069694zbMATH OpenOpenAlexFDO

Authors Jean-Louis Lassez, Michael J. Maher

Publication date 1985

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

Full work available at URL https://doi.org/10.1016/0304-3975(85)90128-8

zbMATH Keywords

least fixed pointslogic programmingoptimal fixed pointsthree-valued logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3848592
• Fixpoint semantics for logic programming a survey
• A kripke-kleene semantics for logic programs*
• A fixed point semantics for logic programs extended with cuts
• The well-founded semantics for general logic programs

Cites work

• Closures and fairness in the semantics of programming logic
• Contributions to the Theory of Logic Programming
• scientific article; zbMATH DE number 3866574 (Why is no real title available?)
• scientific article; zbMATH DE number 3664336 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• The optimal approach to recursive programs
• The Semantics of Predicate Logic as a Programming Language
• The Theoretical Aspects of the Optimal Fixedpoint

Cited in

(14)

• Partial models and logic programming
• Kernel-LEAF: A logic plus functional language
• The fixed points of logic programs with Herbrand base \({\mathbb{N}}\)
• scientific article; zbMATH DE number 1696794 (Why is no real title available?)
• scientific article; zbMATH DE number 1824109 (Why is no real title available?)
• scientific article; zbMATH DE number 3848592 (Why is no real title available?)
• scientific article; zbMATH DE number 1059312 (Why is no real title available?)
• On the Floyd–Warshall algorithm for logic programs
• Extremal solutions of inequations over lattices with applications to supervisory control
• Data types over multiple-valued logics
• Programming in three-valued logic
• Negation in rule-based database languages: A survey
• Protected completions of first-order general logic programs
• Recursion equation sets computing logic programs

This page was built for publication: Optimal fixedpoints of logic programs

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