Optimal fixedpoints of logic programs
From MaRDI portal
Publication:1069694
DOI10.1016/0304-3975(85)90128-8zbMATH Open0584.68029OpenAlexW2061490938MaRDI QIDQ1069694FDOQ1069694
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Semantics of Predicate Logic as a Programming Language
- Title not available (Why is that?)
- Contributions to the Theory of Logic Programming
- The Theoretical Aspects of the Optimal Fixedpoint
- The optimal approach to recursive programs
- Closures and fairness in the semantics of programming logic
- Title not available (Why is that?)
Cited In (14)
- Title not available (Why is that?)
- Programming in three-valued logic
- Title not available (Why is that?)
- Partial models and logic programming
- The fixed points of logic programs with Herbrand base \({\mathbb{N}}\)
- Data types over multiple-valued logics
- Title not available (Why is that?)
- Protected completions of first-order general logic programs
- Negation in rule-based database languages: A survey
- Recursion equation sets computing logic programs
- On the Floyd–Warshall algorithm for logic programs
- Title not available (Why is that?)
- Kernel-LEAF: A logic plus functional language
- Extremal solutions of inequations over lattices with applications to supervisory control
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)