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 transf...

Full description

Bibliographic Details
Main Author:	Khabya, Komal
Format:	Others
Published:	Digital Archive @ GSU 2010
Subjects:	Logic programming Stable model Fitting’s model
Online Access:	http://digitalarchive.gsu.edu/cs_theses/68 http://digitalarchive.gsu.edu/cgi/viewcontent.cgi?article=1068&context=cs_theses

id	ndltd-GEORGIA-oai-digitalarchive.gsu.edu-cs_theses-1068
record_format	oai_dc
spelling	ndltd-GEORGIA-oai-digitalarchive.gsu.edu-cs_theses-10682013-04-23T03:16:56Z A Novel Stable Model Computation Approach for General Dedcutive Databases Khabya, Komal 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. 2010-07-15 text application/pdf http://digitalarchive.gsu.edu/cs_theses/68 http://digitalarchive.gsu.edu/cgi/viewcontent.cgi?article=1068&context=cs_theses Computer Science Theses Digital Archive @ GSU Logic programming Stable model Fitting’s model
collection	NDLTD
format	Others
sources	NDLTD
topic	Logic programming Stable model Fitting’s model
spellingShingle	Logic programming Stable model Fitting’s model Khabya, Komal A Novel Stable Model Computation Approach for General Dedcutive Databases
description	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.
author	Khabya, Komal
author_facet	Khabya, Komal
author_sort	Khabya, Komal
title	A Novel Stable Model Computation Approach for General Dedcutive Databases
title_short	A Novel Stable Model Computation Approach for General Dedcutive Databases
title_full	A Novel Stable Model Computation Approach for General Dedcutive Databases
title_fullStr	A Novel Stable Model Computation Approach for General Dedcutive Databases
title_full_unstemmed	A Novel Stable Model Computation Approach for General Dedcutive Databases
title_sort	novel stable model computation approach for general dedcutive databases
publisher	Digital Archive @ GSU
publishDate	2010
url	http://digitalarchive.gsu.edu/cs_theses/68 http://digitalarchive.gsu.edu/cgi/viewcontent.cgi?article=1068&context=cs_theses
work_keys_str_mv	AT khabyakomal anovelstablemodelcomputationapproachforgeneraldedcutivedatabases AT khabyakomal novelstablemodelcomputationapproachforgeneraldedcutivedatabases
_version_	1716583347517390848

A Novel Stable Model Computation Approach for General Dedcutive Databases

Similar Items