Computing stable models of logic programs
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 i...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
UKnowledge
2003
|
| Subjects: | |
| Online Access: | http://uknowledge.uky.edu/gradschool_theses/223 http://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1225&context=gradschool_theses |