Answer set programming via mixed integer programming

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2012, Pages 32-42

  Liu, Guohua ^a   Janhunen, Tomi ^a   Niemelä, Ilkka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; PROBLEM ORIENTED LANGUAGES;

ANSWER SET PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; LINEAR CONSTRAINTS; MIXED INTEGER PROGRAMMING; OPTIMIZATION PROBLEMS; PROGRAMMING PARADIGMS; PROTOTYPE SYSTEM; STATE OF THE ART;

INTEGER PROGRAMMING;

EID: 84885683675     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Apt, K.; Blair, H.; and Walker, A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases. Morgan Kaufmann. Chapter 2.
2. Balduccini, M. 2011. Industrial-size scheduling with ASP+CP. In Proc. LPNMR'11, Volume 6645 of LNCS, 284-296.
3. Bell, C.; Nerode, A.; Ng, R. T.; and Subrahmanian, V. S. 1994. Mixed integer programming methods for computing nonmonotonic deductive databases. J. ACM 41(6):1178-1215.
4. Brewka, G.; Eiter, T.; and Truszczyński, M. 2011. Answer set programming at a glance. Commun. ACM 54(12):92-103.
5. Denecker, M.; Vennekens, J.; Bond, S.; Gebser, M.; and Truszczynski, M. 2009. The second answer set programming competition. In Proc. LPNMR'09, 637-654.
6. Dutertre, B., and de Moura, L. M. 2006. A fast linear-arithmetic solver for DPLL(T). In Proc. CAV, 81-94.
7. Gebser, M.; Kaufmann, B.; and Schaub, T. 2009. Conflict-driven answer set solver clasp: Progress report. In Proc. LPNMR'09, 509-514.
8. Gebser, M.; Ostrowski, M.; and Schaub, T. 2009. Constraint answer set solving. In Proc. ICLP'09, 235-249.
9. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. ICLP'88, 1070-1080.
10. Janhunen, T., and Niemelä, T. 2011. Compact translations of non-disjunctive answer set programs to propo-sitional clauses. In Michael Gelfond's 65th Anniversary Festscrift, Volume 6565 of LNCS, 111-130.
11. Janhunen, T.; Niemelä, I.; and Sevalnev, M. 2009. Computing stable models via reductions to difference logic. In Proc. LPNMR'09, 142-154.
12. Janhunen, T. 2004. Representing normal programs with clauses. In Proc. ECAI'04, 358-362.
13. Li, R.; Zhou, D.; and Du, D. 2004. Satisfiability and integer programming as complementary tools. In Proc. ASP-DAC'04, 879-882.
14. Lin, F., and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2):115-137.
15. Liu, L., and Truszczyński, M. 2006. Properties and applications of programs with monotone and convex constraints. JAIR 7:299-334.
16. Liu, G., and You, J.-H. 2010. Level mapping induced loop formulas for weight constraint and aggregate logic programs. Fundam. Inform. 101(3):237-255.
17. Marek, V., and Subrahmanian, V. 1992. The relationship between stable, supported, default and autoepistemic semantics for general logic programs. TCS 103:365-386.
18. Marek, V.; Niemelä, I.; and Truszczyński, M. 2008. Logic programs with monotone abstract constraint atoms. TPLP 8(2):167-199.
19. Mellarkod, V. S.; Gelfond, M.; and Zhang, Y. 2008. Integrating answer set programming and constraint logic programming. Annals of Math. and AI 53(1-4):251-287.
20. Niemelä, I. 2008. Stable models and difference logic. Annals of Math. and AI 53(1-4):313-329.
21. Nieuwenhuis, R.; Oliveras, A.; and Tinelli, C. 2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). JACM 53(6):937-977.
22. Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2):181-234.