Optimal fixedpoints of logic programs

DOI10.1016/0304-3975(85)90128-8zbMath0584.68029OpenAlexW2061490938MaRDI QIDQ1069694

Michael J. Maher, Jean-Louis Lassez

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

three-valued logiclogic programmingleast fixed pointsoptimal fixed points

Mathematics Subject Classification ID

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

Related Items (9)

Partial models and logic programming ⋮ Kernel-LEAF: A logic plus functional language ⋮ The fixed points of logic programs with Herbrand base \({\mathbb{N}}\) ⋮ Protected completions of first-order general logic programs ⋮ Recursion equation sets computing 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closures and fairness in the semantics of programming logic
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• The Theoretical Aspects of the Optimal Fixedpoint
• The optimal approach to recursive programs

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