Analysis of normal logic programs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we present a dataflow analysis method for nor-mal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic pro-grams: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation.

Original languageEnglish
Title of host publicationStatic Analysis - 5th International Symposium, SAS 1998, Proceedings
PublisherSpringer Verlag
Pages82-98
Number of pages17
ISBN (Print)3540650148, 9783540650140
DOIs
Publication statusPublished - 1 Jan 1998
Event5th International Symposium on Static Analysis, SAS 1998 - Pisa, Italy
Duration: 14 Sept 199816 Sept 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1503 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Symposium on Static Analysis, SAS 1998
Country/TerritoryItaly
CityPisa
Period14/09/9816/09/98

Keywords

  • Abstract interpretation
  • Constructive negation
  • Logic programming
  • Static analysis

Fingerprint

Dive into the research topics of 'Analysis of normal logic programs'. Together they form a unique fingerprint.

Cite this