Partial models and logic programming
type: Item
instance of: scholarly article
title: Partial models and logic programming
zbMATH Open document ID: 0629.68090
DOI: 10.1016/0304-3975(86)90096-4
author: Melvin Fitting
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
review text: The author carries on investigations of the treatment of negation in logic programming with negation initiated in his earlier work [J. Logic Programming 2, 295--312 (1985; Zbl 0589.68011)]. Essential feature is the treatment of partial models containing statements not only about truth of some (not necessarily atomic) formulas but also about their falsity. The model extension operation considered is based on the treatment of rules \(L\leftarrow A\) as equivalences. Several types of fixed point semantics for logic programs are proposed and one of them turns out to be recursively enumerable (weak semantics). A corresponding system of semantic tableaux is constructed such that the rules corresponding to the rules of the logic program remind familiar modal rules.
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 03B50
zbMATH DE Number: 4024830
zbMATH Keywords: fixed point semantics
zbMATH Keywords: negation
zbMATH Keywords: logic programming
zbMATH Keywords: partial models
reviewed by: G. E. Mints
MaRDI profile type: Publication
full work available at URL: 0304-3975(86)90096-4
OpenAlex ID: W1964113811
cites work: Contributions to the Theory of Logic Programming
cites work: A kripke-kleene semantics for logic programs*
cites work: On the existence of optimal fixpoints
cites work: Q5812175
cites work: Outline of a Theory of Truth
cites work: Optimal fixedpoints of logic programs
cites work: The Theoretical Aspects of the Optimal Fixedpoint
cites work: Q5560258
cites work: The Semantics of Predicate Logic as a Programming Language
description: scientific article; zbMATH DE number 4024830