Max-ASP: Maximum satisfiability of answer set programs

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

Volumn 5753 LNAI, Issue , 2009, Pages 236-249

  Oikarinen, Emilia ^a   Järvisalo, Matti ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; BRANCH-AND-BOUND ALGORITHMS; INFERENCE RULES; LOGIC PROGRAMS; MAX-SAT; MAX-SAT PROBLEMS; MAXIMUM SATISFIABILITY; OPTIMAL MODEL; OPTIMIZATION CRITERIA; PROPOSITIONAL FORMULAS; SOFT CONSTRAINT; TOTAL COSTS;

ALGORITHMS; INFERENCE ENGINES; LOGIC PROGRAMMING;

OPTIMIZATION;

EID: 70349865191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04238-6_21     Document Type: Conference Paper

References (15)

1. Gebser, M., Pührer, J., Schaub, T., Tompits, H.: A meta-programming technique for debugging answer-set programs. In: Proc. AAAI 2008, pp. 448-453. AAAI Press, Menlo Park (2008)
2. Li, C., Manýa, F.: MaxSAT, hard and soft constraints. In: Handbook of Satisfiability. IOS Press, Amsterdam (2009)
3. Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient Max-SAT solving. Artificial Intelligence 172(2-3), 204-233 (2008)
4. Bonet, M., Levy, J., Manỳa, F.: Resolution for Max-SAT. Artificial Intelligence 171(8-9), 606-618 (2007)
5. Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczýnski, M. (eds.) ICLP 2006. LNCS, vol.4079, pp. 11-25. Springer, Heidelberg (2006) (Pubitemid 44492579)
6. Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering 12(5), 845-860 (2000)
7. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181-234 (2002)
8. Brewka, G., Niemelä, I., Truszczynski, M.: Answer set optimization. In: Proc. IJCAI 2003, pp. 867-872. Morgan Kaufmann, San Francisco (2003)
9. Gebser,M., Gharib,M., Mercer, R., Schaub, T.:Monotonic answer set programming. Journal of Logic and Computation (in press, 2009), doi:10.1093/logcom/exn040
10. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. ICLP/SLP 1988, pp. 1070-1080. MIT Press, Cambridge (1988)
11. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1995)
12. Clark, K.: Negation as failure. In: Readings in nonmonotonic reasoning, pp. 311-325. Morgan Kaufmann, San Francisco (1987)
13. Fages, F.: Consistency of Clark's completion and existence of stable models. Journal ofMethods of Logic in Computer Science 1, 51-60 (1994)
14. Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115-137 (2004)
15. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3-4), 241-273 (1999)