SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
type: Item
instance of: scholarly article
title: SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
zbMATH Open document ID: 0872.68018
DOI: 10.1016/0304-3975(95)00109-3
author: Susumu Yamasaki
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 984052
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00109-3
OpenAlex ID: W2020251941
cites work: Properties of substitutions and unifications
cites work: Declarative modeling of the operational behavior of logic languages
cites work: A kripke-kleene semantics for logic programs*
cites work: The well-founded semantics for general logic programs
cites work: Abductive Logic Programming
cites work: Negation in logic programming
cites work: Q3339245
cites work: The relationship between stable, supported, default and autoepistemic semantics for general logic programs
cites work: Bottom-up dataflow analysis of normal logic programs
cites work: Q4038706
cites work: Negation as failure. II
cites work: Q5750391
cites work: A sound and complete semantics for a version of negation as failure
description: scientific article; zbMATH DE number 984052