Negation by default and unstratifiable logic programs
type: Item
instance of: scholarly article
title: Negation by default and unstratifiable logic programs
zbMATH Open document ID: 0716.68075
DOI: 10.1016/0304-3975(51)90004-7
author: Christine Froidevaux
author: Nicole Bidoit
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 4180828
zbMATH Keywords: negation by default
zbMATH Keywords: stratification
MaRDI profile type: Publication
full work available at URL: 0304-3975(51)90004-7
OpenAlex ID: W2010160994
cites work: Contributions to the Theory of Logic Programming
cites work: General logical databases and programs: Default logic semantics and stratification
cites work: Minimalism, justification and non-monotonicity in deductive databases
cites work: Saturation, nonmonotonic reasoning and the closed-world assumption
cites work: Horn clause queries and generalizations
cites work: Q5679729
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: A Computing Procedure for Quantification Theory
cites work: Q4052071
cites work: Q3743300
cites work: On the relation between default and autoepistemic logic
cites work: Why not negation by fixpoint?
cites work: Q3339245
cites work: Q5750390
cites work: Complete logic programs with domain-closure axiom
cites work: Semantical considerations on nonmonotonic logic
cites work: A logic for default reasoning
cites work: Negation as failure. II
cites work: Q5750391
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: Q3348436
description: scientific article; zbMATH DE number 4180828