Partial models and logic programming

DOI10.1016/0304-3975(86)90096-4zbMath0629.68090OpenAlexW1964113811MaRDI QIDQ1094151

Melvin Fitting

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90096-4

zbMATH Keywords

negationlogic programmingpartial modelsfixed point semantics

Mathematics Subject Classification ID

Related Items (11)

On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Institutions of variable truth values: An approach in the ordered style ⋮ A theory of formal truth arithmetically equivalent to ID₁ ⋮ A first order logic for partial functions ⋮ A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses ⋮ Equivalence in two-, three, and four-dimensional space-times ⋮ A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete ⋮ Graph properties for normal logic programs ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ Programming in three-valued logic ⋮ Fixpoint semantics for logic programming a survey

Cites Work

• Optimal fixedpoints of logic programs
• A kripke-kleene semantics for logic programs*
• On the existence of optimal fixpoints
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• The Theoretical Aspects of the Optimal Fixedpoint
• Outline of a Theory of Truth
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial models and logic programming