SLT-resolution for the well-founded semantics
type: Item
instance of: scholarly article
title: SLT-resolution for the well-founded semantics
zbMATH Open document ID: 1003.68066
DOI: 10.1023/A:1020116927466
author: Yi-Dong Shen
author: Jia-Huai You
author: Li Yan Yuan
published in: Journal of Automated Reasoning
publication date: 2002-10-15T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1744326
zbMATH Keywords: procedural semantics
zbMATH Keywords: linear tabling
zbMATH Keywords: global SLS-resolution
zbMATH Keywords: SLG-resolution
MaRDI profile type: Publication
full work available at URL: a:1020116927466
OpenAlex ID: W1589528070
Recommended article: Tabulated resolution for the well-founded semantics
Recommended article: ON THE PROPOSITIONAL SLDNF-RESOLUTION
Recommended article: A full formalization of SLD-resolution in the calculus of inductive constructions
Recommended article: A completeness theorem for SLDNF resolution
Recommended article: A Completeness Result for SLDNF-Resolution
Recommended article: Q3727360
Recommended article: Q3832076
Recommended article: Q3485886
Recommended article: A direct proof of the completeness of SLDNF-resolution
Recommended article: Q4282517
description: scientific article; zbMATH DE number 1744326