BanbaraM., GebserM., InoueK., OstrowskiM., PeanoA., SchaubT., SohT., TamuraN. and WeiseM.
2015. Aspartame: Solving constraint satisfaction problems with answer set programming. In Proc. of the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), Calimeri F., Ianni G. and Truszczyński M., Eds. Lecture Notes in Artificial Intelligence, vol. 9345. Springer-Verlag, 112–126.
BanbaraM., KaufmannB., OstrowskiM. and SchaubT.
2017. Clingcon: The next generation. Theory and Practice of Logic Programming
17, 4, 408–461.
2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
BarrettC., SebastianiR., SeshiaS. and TinelliC.
2009. Satisfiability modulo theories. In Handbook of Satisfiability, vol. 185, Biere A., Heule M., van Maaren H. and Walsh T., Eds. Frontiers in Artificial Intelligence and Applications. IOS Press, Chapter 26, 825–885.
BartholomewM. and LeeJ.
2014. System aspmt2smt: Computing ASPMT theories by SMT solvers. In Proc. of the 14th European Conference on Logics in Artificial Intelligence (JELIA'14), Fermé E. and Leite J., Eds. Lecture Notes in Artificial Intelligence, vol. 8761. Springer-Verlag, 529–542.
CabalarP., OteroR. and PoseS.
2000. Temporal constraint networks in action. In Proc. of the 14th European Conference on Artificial Intelligence (ECAI'00), Horn W., Ed. IOS Press, 543–547.
CarroM. and KingA., Eds. 2016. Technical Communications of the 32nd International Conference on Logic Programming (ICLP'16). vol. 52. Open Access Series in Informatics (OASIcs).
CottonS. and MalerO.
2006. Fast and flexible difference constraint propagation for DPLL (T). In Proc. of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT'06), Biere A. and Gomes C., Eds. Lecture Notes in Computer Science, vol. 4121. Springer-Verlag, 170–183.
CrawfordJ. and BakerA.
1994. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proc. of the 12th National Conference on Artificial Intelligence (AAAI'94), Hayes-Roth B. and Korf R., Eds. AAAI Press, 1092–1097.
1963. Linear Programming and Extensions. Princeton University Press.
De RosisA., EiterT., RedlC. and RiccaF.
2015. Constraint answer set programming based on HEX-programs. In Proc. of the 8th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'15), Inclezan D. and Maratea M., Eds.
DrescherC. and WalshT.
2010. A translational approach to constraint answer set solving. Theory and Practice of Logic Programming
10, 4–6, 465–480.
GebserM., KaminskiR., KaufmannB., OstrowskiM., SchaubT. and WankoP.
2016. Theory solving made easy with clingo 5. Technical Communications of the 32nd International Conference on Logic Programming (ICLP'16). vol. 52. Open Access Series in Informatics (OASIcs), 2:1–2:15.
GebserM., KaminskiR., KaufmannB. and SchaubT.
2014. Clingo = ASP + control: Preliminary report. In Technical Communications of the 30th International Conference on Logic Programming (ICLP'14), Leuschel M. and Schrijvers T., Eds. Theory and Practice of Logic Programming, Online Supplement, vol. arXiv:1405.3694v1. Available at http://arxiv.org/abs/1405.3694v1.
GebserM., KaufmannB. and SchaubT.
2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence
GelfondM. and LifschitzV.
1991. Classical negation in logic programs and disjunctive databases. New Generation Computing
1991. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys (CSUR)
23, 1, 5–48.
JanhunenT., LiuG. and NiemeläI.
2011. Tight integration of non-ground answer set programming and satisfiability modulo theories. In Proc. of the 1st Workshop on Grounding and Transformation for Theories with Variables (GTTV'11), Cabalar P., Mitchell D., Pearce D. and Ternovska E., Eds. 1–13.
LierlerY. and SusmanB.
2016. SMT-based constraint answer set solver EZSMT (system description). Technical Communications of the 32nd International Conference on Logic Programming (ICLP'16). vol. 52. Open Access Series in Informatics (OASIcs), 1:1–1:15.
LiuG., JanhunenT. and NiemeläI.
2012. Answer set programming via mixed integer programming. In Proc. of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR'12), Brewka G., Eiter T. and McIlraith S., Eds. AAAI Press, 32–42.
SimonsP., NiemeläI. and SoininenT.
2002. Extending and implementing the stable model semantics. Artificial Intelligence
138, 1–2, 181–234.
SohT., InoueK., TamuraN., BanbaraM. and NabeshimaH.
2010. A SAT-based method for solving the two-dimensional strip packing problem. Fundamenta Informaticae
102, 3–4, 467–487.
1993. Benchmarks for basic scheduling problems. European Journal of Operational Research
64, 2, 278–285.
1981. Irreducibly inconsistent systems of linear inequalities. European Journal of Operational Research