Industrial-size scheduling with ASP+CP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6645 LNAI, Issue , 2011, Pages 284-296

  Balduccini, Marcello ^a  

^a EASTMAN KODAK COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; CONSTRAINT PROGRAMMING; HYBRID LANGUAGES; KNOWLEDGE REPRESENTATION FORMALISM; LANGUAGE CONSTRUCTS; SCHEDULING PROBLEM; INDUSTRIAL SIZE;

CONSTRAINT THEORY; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; SCHEDULING; COMPUTATION THEORY; COMPUTER CIRCUITS; COMPUTER PROGRAMMING;

INDUSTRY; LOGIC PROGRAMMING;

EID: 79955747791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20895-9_33     Document Type: Conference Paper

References (13)

1. Balduccini, M.: Representing Constraint Satisfaction Problems in Answer Set Programming. In: ICLP 2009 Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009) (July 2009)
2. Balduccini, M., Girotto, S.: Formalization of Psychological Knowledge in Answer Set Programming and its Application. Journal of Theory and Practice of Logic Programming (TPLP) 10(4-6), 725-740 (2010)
3. Baselice, S., Bonatti, P.A., Gelfond, M.: Towards an Integration of Answer Set and Constraint Solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 52-66. Springer, Heidelberg (2005) (Pubitemid 41491593)
4. Beldiceanu, N., Contejean, E.: Introducing Global Constraints in CHIP. Mathl. Comput. Modelling 20(12), 97-123 (1994)
5. Carlson, B., Carlsson, M., Ottosson, G.: An Open-Ended Finite Domain Constraint Solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292. Springer, Heidelberg (1997)
6. Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczyński, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637-654. Springer, Heidelberg (2009)
7. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M.M. (ed.) Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386-392. MIT Press, Cambridge (2007)
8. Gebser, M., Ostrowski, M., Schaub, T.: Constraint Answer Set Solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235-249. Springer, Heidelberg (2009)
9. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385 (1991)
10. Katriel, I., van Hoeve, W.J.: Global Constraints. In: Handbook of Constraint Programming, ch. 6. Foundations of Artificial Intelligence, pp. 169-208. Elsevier, Amsterdam (2006)
11. Marek, V.W., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375-398. Springer, Berlin (1999)
12. Mellarkod, V.S., Gelfond, M., Zhang, Y.: Integrating Answer Set Programming and Constraint Logic Programming. Annals of Mathematics and Artificial Intelligence (2008)
13. Smith, B.M.: Modelling. In: Handbook of Constraint Programming, ch. 11. Foundations of Artificial Intelligence, pp. 377-406. Elsevier, Amsterdam (2006)