WFS + Branch and Bound = Stable Models

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1992
Accession Number
ADA455012

Entities

People

  • C. Vago
  • Dana S. Nau
  • V. S. Subrahmanian

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Availability
  • Classification
  • Computations
  • Computer Programming
  • Contracts
  • Cooperation
  • Databases
  • Efficiency
  • Information Operations
  • Instructions
  • Maryland
  • Models
  • Monitoring
  • Semantics
  • Standards
  • Universities

Fields of Study

  • Computer science

Readers

  • Aerospace Test and Evaluation
  • Artificial Intelligence
  • Mathematical Modeling and Probability Theory.