The alternating fixpoint of logic programs with negation
type: Item
instance of: scholarly article
title: The alternating fixpoint of logic programs with negation
zbMATH Open document ID: 0793.68039
DOI: 10.1016/0022-0000(93)90024-Q
published in: Journal of Computer and System Sciences
publication date: 1993-10-10T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 06B99
zbMATH DE Number: 428588
zbMATH Keywords: stable models
zbMATH Keywords: negation as failure
zbMATH Keywords: stratified semantics
zbMATH Keywords: logic program with negation
zbMATH Keywords: least fixpoint
zbMATH Keywords: negative conclusions
zbMATH Keywords: positive conclusions
zbMATH Keywords: Horn clause semantics
zbMATH Keywords: alternating fixpoint partial model
zbMATH Keywords: well-founded partial model
zbMATH Keywords: fixpoint logic
zbMATH Keywords: alternating fixpoint logic
author: Allen Van Gelder
MaRDI profile type: Publication
cites work: Contributions to the Theory of Logic Programming
cites work: Negation by default and unstratifiable logic programs
cites work: Horn clause queries and generalizations
cites work: Structure and complexity of relational queries
cites work: Q3975936
cites work: A rational reconstruction of nonmonotonic truth maintenance systems
cites work: A kripke-kleene semantics for logic programs*
cites work: Fixed-point extensions of first-order logic
cites work: Relational queries computable in polynomial time
cites work: Why not negation by fixpoint?
cites work: Q3862380
cites work: Negation in logic programming
cites work: Inductive definitions over finite structures
cites work: Q5750390
cites work: Q3486550
cites work: Q3339245
cites work: Making prolog more expressive
cites work: Autoepistemic logic
cites work: Q3477931
cites work: Semantical considerations on nonmonotonic logic
cites work: Elementary induction on abstract structures
cites work: Q3484349
cites work: Q3348437
cites work: Reasoning with knowledge and belief
cites work: A procedural semantics for well-founded negation in logic programs
cites work: Formalizing a logic for logic programming
cites work: Negation as failure. II
cites work: Q5750391
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: Negation as failure using tight derivations for general logic programs
cites work: The well-founded semantics for general logic programs
full work available at URL: 0022-0000(93)90024-q
OpenAlex ID: W4212881215
description: scientific article; zbMATH DE number 428588