A nondeterministic well-founded semantics
type: Item
instance of: scholarly article
title: A nondeterministic well-founded semantics
zbMATH Open document ID: 0868.68022
DOI: 10.1007/BF01530893
author: Alberto Torres
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 937235
zbMATH Keywords: partial stable models
zbMATH Keywords: well-founded semantics
MaRDI profile type: Publication
cites work: Recent problems and results about kernels in directed graphs
cites work: Graph theoretical structures in logic programs and default theories
cites work: Q4028794
cites work: Q3348436
cites work: Abductive Logic Programming
cites work: Short note preferred extensions are partial stable models
cites work: Autoepistemic logic
cites work: Q5844986
cites work: Q3486858
cites work: Tie-breaking semantics and structural totality
Recommended article: A non-ground realization of the stable and well-founded semantics
Recommended article: Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
Recommended article: A constructive semantics for non‐deducibility
Recommended article: Semantics of non-deterministic possibility computation
Recommended article: Nonwellfounded sets and programming language semantics
Recommended article: Q3708776
Recommended article: Q5028431
Recommended article: A tutorial on the well-founded semantics
description: scientific article; zbMATH DE number 937235