Return to search

A Novel Stable Model Computation Approach for General Dedcutive Databases

The aim of this thesis is to develop faster method for stable model computation of non-stratified logic programs and study its efficiency. It focuses mainly on the stable model and weak well founded semantics of logic programs. We propose an approach to compute stable models by where we first transform the logic program using paraconsistent relational model, then we compute the weak-well founded model which is used to generate a set of models consisting of the true and unknown values, which are tested for stability. We perform some experiments to test the efficiency of our approach which incurs overhead to eliminate negative values against a Naïve method of stable model computation.

Identiferoai:union.ndltd.org:GEORGIA/oai:digitalarchive.gsu.edu:cs_theses-1068
Date15 July 2010
CreatorsKhabya, Komal
PublisherDigital Archive @ GSU
Source SetsGeorgia State University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceComputer Science Theses

Page generated in 0.0021 seconds