Archive.uky.edu: Computing stable models of logic programs

Electronic theses and dissertations are being moved to http://uknowledge.uky.edu/gradschool/. Please search that collection to access documents.

	Archive.uky.edu

Please use this identifier to cite or link to this item: http://hdl.handle.net/10225/214

Title:	Computing stable models of logic programs
Authors:	Singhi, Soumya
Keywords:	Stable model Semantics smodels Search Algorithm Declarative programming Logic programming
Date Created:	2003
Publisher:	University of Kentucky
Abstract:	Solution of any search problem lies in its search space. A search is a systematic examination of candidate solutions of a search problem. In this thesis, we present a search heuristic that we can cr-smodels. cr-smodels prunes the search space to quickly reach to the solution of a problem. The idea is to pick an atom for branching , that lowers the growth rate of the linear recurrence and thuse, minimizes the remaining search space. Our goal in developing cr-smodels is to develop a search heuristic that is efficient on a wide range of problems. Then, we test cr-smodels over a wide range of randomly generated benchmarks. we observed that often randomly generated graphs with no Hamiltonian cycle were trivial to solve. Since, Hamiltonian cycle is an important benchmark problem, my other goal is to develop techniques that generate hard instances of graphs with no Hamiltonian cycle.
URI:	http://hdl.handle.net/10225/214
Appears in Collections:	Electronic Theses and Dissertations

Files in This Item:

File	Description	Size	Format
SSThesis.pdf		765Kb	Adobe PDF	View/Open

This item is protected by original copyright