ON SIMPLE BUT HARD RANDOM INSTANCES OF PROPOSITIONAL THEORIES AND LOGIC PROGRAMS
In the last decade, Answer Set Programming (ASP) and Satisfiability (SAT) have been used to solve combinatorial search problems and practical applications in which they arise. In each of these formalisms, a tool called a solver is used to solve problems. A solver takes as input a specification of th...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
UKnowledge
2011
|
| Subjects: | |
| Online Access: | http://uknowledge.uky.edu/gradschool_diss/132 http://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1136&context=gradschool_diss |