Logic programs with classical negation
Logic programming
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Computer science as empirical inquiry: symbols and search
Communications of the ACM
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
| Hi-index | 0.00 |
We examine issues that arise from creating practical tools that combine answer set programming (ASP) with programs created using traditional programming languages. A tool is mostly written in a traditional language and it calls an ASP solver as an oracle to solve some difficult subproblem that is best represented using ASP. We give a brief introduction on a generate-and-test based methodology for creating ASP programs and on how to optimize them for efficiency. We examine methods for computing answer sets incrementally based on user choices and show how we can guide the user in making the choices and how to give diagnostic information in the case that the user's choices are inconsistent. We use the kakuro puzzles as a practical example.