Domain-specific heuristics in answer set programming

Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013

Volumn , Issue , 2013, Pages 350-356

  Gebser, M ^a   Kaufmann, B ^a   Otero, R ^b   Romero, J ^a,b   Schaub, T ^a   Wanko, P ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

^b UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; DOMAIN SPECIFIC; EMPIRICAL EVALUATIONS; FIRST-ORDER MODELS; HEURISTIC INFORMATION; LOGIC PROGRAMS; TRUTH VALUES;

ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION LANGUAGES; LOGIC PROGRAMMING;

HEURISTIC PROGRAMMING;

EID: 84893348717     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Bacchus, F., and Kabanza, F. 2000. Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116(1-2):123-191.
2. Balduccini, M. 2011. Learning and using domain-specific heuristics in ASP solvers. AI Communic. 24(2):147-164.
3. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
4. Biere, A.; Heule, M.; van Maaren, H.; and Walsh, T., eds. 2009. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press.
5. Calimeri, F. et al. 2011. The third answer set programming competition: Preliminary report of the system competition track. In Delgrande and Faber (2011), 388-403.
6. Castell, T.; Cayrol, C.; Cayrol, M.; and Le Berre, D. 1996. Using the Davis and Putnam procedure for an efficient computation of preferred models. In Wahlster, W., ed., Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI'96), 350-354. John Wiley & sons.
7. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
8. Delgrande, J., and Faber, W., eds. 2011. Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11). Springer.
9. Di Rosa, E.; Giunchiglia, E.; and Maratea, M. 2010. Solving satisfiability problems with preferences. Constraints 15(4):485-515.
10. Faber, W.; Leone, N.; Maratea, M.; and Ricca, F. 2007. Experimenting with look-back heuristics for hard ASP programs. In Baral, C.; Brewka, G.; and Schlipf, J., eds., Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), 110-122. Springer.
11. Faber, W.; Leone, N.; and Pfeifer, G. 2001. Experimenting with heuristics for answer set programming. In Nebel, B., ed., Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), 635-640. Morgan Kaufmann.
12. Freeman, J. 1995. Improvements to Propositional Satisfiability Search Algorithms. Ph.D. Dissertation, University of Pennsylvania.
13. Gebser, M.; Guziolowski, C.; Ivanchev, M.; Schaub, T.; Siegel, A.; Thiele, S.; and Veber, P. 2010. Repair and prediction (under inconsistency) in large biological networks with answer set programming. In Lin, F., and Sattler, U., eds., Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR'10), 497-507. AAAI Press.
14. Gebser, M.; Kaminski, R.; Knecht, M.; and Schaub, T. 2011. plasp: A prototype for PDDL-based planning in ASP. In Delgrande and Faber (2011), 358-363.
15. Gebser, M.; Kaminski, R.; Kaufmann, B.; Schaub, T. 2012. Answer Set Solving in Practice. Morgan and Claypool.
16. Giunchiglia, E., and Maratea, M. 2012. Algorithms for solving satisfiability problems with qualitative preferences. In Erdem, E.; Lee, J.; Lierler, Y.; and Pearce, D., eds., Correct Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz, 327-344. Springer.
17. Goldberg, E., and Novikov, Y. 2002. BerkMin: A fast and robust SAT solver. In Proceedings of the Fifth Conference on Design, Automation and Test in Europe (DATE'02), 142- 149. IEEE Computer Society Press.
18. hclasp. http://www.cs.uni-potsdam.de/hclasp.
19. ICAPS. http://ipc.icaps-conference.org.
20. Järvisalo, M.; Junttila, T.; and Niemelä, I. 2005. Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence 44(4):373-399.
21. Korf, R. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
22. Lifschitz, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138(1-2):39-54.
23. Marques-Silva, J., and Sakallah, K. 1999. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5):506-521.
24. Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the Thirty-eighth Conference on Design Automation (DAC'01), 530-535. ACM Press.
25. Pipatsrisawat, K., and Darwiche, A. 2007. A lightweight component caching scheme for satisfiability solvers. In Marques-Silva, J., and Sakallah, K., eds., Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT'07), 294-299. Springer.
26. Pretolani, D. 1996. Efficiency and stability of hypergraph SAT algorithms. In Johnson, D., and Trick, M., eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, 479-498. American Mathematical Society.
27. Rintanen, J. 2011. Planning with SAT, admissible heuristics and A. In Walsh (2011), 2015-2020.
28. Rintanen, J. 2012. Planning as satisfiability: heuristics. Artificial Intelligence 193:45-86.
29. Schaub, T., and Thiele, S. 2009. Metabolic network expansion with ASP. In Hill, P., and Warren, D., eds., Proceedings of the Twenty-fifth International Conference on Logic Programming (ICLP'09), 312-326. Springer.
30. Siddiqi, S. 2011. Computing minimum-cardinality diagnoses by model relaxation. In Walsh (2011), 1087-1092.
31. Sierra-Santibáñez, J. 2004. Heuristic planning: A declarative approach based on strategies for action selection. Artificial Intelligence 153(1-2):307-337.
32. Walsh, T., ed. 2011. Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI' 11). IJCAI/AAAI.
33. Zhang, L.; Madigan, C.; Moskewicz, M.; and Malik, S. 2001. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'01), 279-285. ACM Press.