Accession Number:

ADA455012

Title:

WFS + Branch and Bound = Stable Models

Descriptive Note:

Technical research rept.

Corporate Author:

MARYLAND UNIV COLLEGE PARK SYSTEMS RESEARCH CENTER

Personal Author(s):

Report Date:

1992-01-01

Pagination or Media Count:

59.0

Abstract:

Though the semantics of non-monotonic logic programming has been studied extensively, relatively little work has been done on operational aspects of these semantics. This paper develops techniques to compute the well founded model of a logic program. We describe a prototype implementation and show, based on experimental results, that our technique is more efficient than the standard alternating fixpoint computation. Subsequently, we develop techniques to compute the set of all stable mods of a deductive database. These techniques first compute the well founded semantics and then use an intelligent branch and bound strategy to compute the stable models. We report on our implementation, as well as on experiments that we have conducted on the efficiency of our approach.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE