Graph properties for normal logic programs

DOI10.1016/0304-3975(93)90172-PzbMath0768.68008OpenAlexW2072224912MaRDI QIDQ1208418

Gilberto File, Agostino Cortesi

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90172-p

zbMATH Keywords

resolutionnegationnormal logic programsdeclarative semanticsconsistent completionHerbrand basis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic programming (68N17)

Related Items (1)

A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete

Cites Work

• Partial models and logic programming
• A completeness theorem for SLDNF resolution
• Completed logic programs and their consistency
• A Computing Procedure for Quantification Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph properties for normal logic programs