Graph properties for normal logic programs
type: Item
instance of: scholarly article
title: Graph properties for normal logic programs
zbMATH Open document ID: 0768.68008
DOI: 10.1016/0304-3975(93)90172-P
author: Agostino Cortesi
author: Gilberto File
published in: Theoretical Computer Science
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 166429
zbMATH Keywords: normal logic programs
zbMATH Keywords: declarative semantics
zbMATH Keywords: negation
zbMATH Keywords: resolution
zbMATH Keywords: consistent completion
zbMATH Keywords: Herbrand basis
MaRDI profile type: Publication
cites work: Q4132480
cites work: A completeness theorem for SLDNF resolution
cites work: A Computing Procedure for Quantification Theory
cites work: Partial models and logic programming
cites work: Q5750390
cites work: Q3992908
cites work: Q3348437
cites work: Completed logic programs and their consistency
cites work: Q5750391
cites work: Q3348436
full work available at URL: 0304-3975(93)90172-p
OpenAlex ID: W2072224912
description: scientific article; zbMATH DE number 166429