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...
Main Author: | Khabya, Komal |
---|---|
Format: | Others |
Published: |
Digital Archive @ GSU
2010
|
Subjects: | |
Online Access: | http://digitalarchive.gsu.edu/cs_theses/68 http://digitalarchive.gsu.edu/cgi/viewcontent.cgi?article=1068&context=cs_theses |
Similar Items
-
Computing stable models of logic programs
by: Singhi, Soumya
Published: (2003) -
First-order stable model semantics with intensional functions
by: Bartholomew, M., et al.
Published: (2019) -
Representing actions in logic-based languages
by: Yang, Fangkai
Published: (2014) -
Answer Set Programming and Other Computing Paradigms
Published: (2013) -
A Note on the Uniqueness of Stable Marriage Matching
by: Drgas-Burchardt Ewa
Published: (2013-03-01)