Conflict-driven ASP solving with external sources

Theory and Practice of Logic Programming

Volumn 12, Issue 4-5, 2012, Pages 659-679

  Eiter, Thomas ^a   Fink, Michael ^a   Krennwallner, Thomas ^a   Redl, Christoph ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Answer set programming; conflict driven clause learning; nonmonotonic reasoning

Indexed keywords

ADDITIONAL KNOWLEDGE; ANSWER SET; ANSWER SET PROGRAMMING; BI-DIRECTIONAL COMMUNICATION; CLAUSE LEARNING; DESCRIPTION LOGIC; EXTERNAL SOURCES; LEARNING TECHNIQUES; LOGIC PROGRAMS; META INFORMATION; NON-DETERMINISM; NON-MONOTONIC REASONING; NONMONOTONIC LOGIC PROGRAMS; RUNTIMES; WEB RESOURCES;

ALGORITHMS; DATA DESCRIPTION; LOGIC PROGRAMMING;

PROGRAM TRANSLATORS;

EID: 84866906055     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068412000233     Document Type: Conference Paper

References (27)

1. Brewka, G. and Eiter, T. 2007. Equilibria in heterogeneous nonmonotonic multi-context systems. In AAAI'07. AAAI Press, 385-390. (Pubitemid 350153474)
2. Brewka, G., Eiter, T. and Truszczyński, M. 2011. Answer set programming at a glance. Commun. ACM 54, 12, 92-103.
3. Biere, A., Heule, M. J. H., van Maaren, H. and Walsh, T., Eds. 2009. Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press
4. Dao-Tran, M., Eiter, T. and Krennwallner, T. 2009. Realizing default logic over description logic knowledge bases. In ECSQARU'09. Springer, 602-613.
5. Drescher, C., Gebser,M., Grote, T., Kaufmann, B., K̈onig, A., Ostrowski, M. and Schaub, T. 2008. Conflict-driven disjunctive answer set solving. In KR'08. AAAI Press, 422-432.
6. Eiter, T., Fink, M., Ianni, G., Krennwallner, T., and Scḧuller, P. 2011. Pushing efficient evaluation of HEX programs by modular decomposition. In LPNMR'11. Springer, 93-106.
7. Eiter, T., Fink, M., Scḧuller, P. and Weinzierl, A. 2010. Finding explanations of inconsistency in multi-context systems. In KR'10. AAAI Press, 329-339.
8. Eiter, T., Ianni, G., Krennwallner, T. and Schindlauer, R. 2008. Exploiting conjunctive queries in description logic programs. Annals of Mathematics and Artificial Intelligence 53, 1-4, 115-152.
9. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R. and Tompits, H. 2008. Combining answer set programming with description logics for the semantic web. Artificial Intelligence 172, 12-13, 1495-1539.
10. Eiter, T., Ianni, G., Schindlauer, R. and Tompits, H. 2005. A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In IJCAI'05. Professional Book Center, 90-96.
11. Eiter, T., Ianni, G., Schindlauer, R. and Tompits, H. 2006. Effective integration of declarative rules with external evaluations for semantic-web reasoning. In ESWC'06. Springer, 273-287. (Pubitemid 44071165)
12. Faber, W., Leone, N. and Pfeifer, G. 2011. Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175, 1, 278-298.
13. Fages, F. 1994. Consistency of clark's completion and existence of stable models. J. Meth. Logic Comp. Sci. 1, 51-60.
14. Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T. and Schneider, M. T. 2011. Potassco: The Potsdam answer set solving collection. AI Communications 24, 2, 107-124.
15. Gebser, M., Kaufmann, B. and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187-188, 52-89.
16. Gebser, M., Ostrowski, M. and Schaub, T. 2009. Constraint answer set solving. In ICLP'09. Springer, 235-249.
17. Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generat. Comput. 9, 3-4, 365-386.
18. Giunchiglia, E., Lierler, Y. and Maratea, M. 2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36, 4, 345-377. (Pubitemid 46046675)
19. Goldberg, E. and Novikov, Y. 2007. BerkMin: A fast and robust SAT-solver. Discrete Applied Mathematics 155, 12, 1549-1561. (Pubitemid 46899232)
20. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S. and Scarcello, F. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computer Logic 7, 3, 499-562. (Pubitemid 44330485)
21. Lifschitz, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138, 39-54.
22. Lin, F. and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157, 1-2, 115-137.
23. Marek, V. W. and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm. Springer, 375-398.
24. Motik, B. and Sattler, U. 2006. A comparison of reasoning techniques for querying large description logic ABoxes. In LPAR'06. Springer, 227-241. (Pubitemid 44850679)
25. Niemel̈a, I. 1999. Logic Programming with Stable Model Semantics as Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence 25, 3-4, 241-273.
26. Ostrowski, M. and Schaub, T. 2012. ASP modulo CSP: The clingcon system. Theor. Pract. Log. Prog., Special Issue 28th Intl. Conf. Logic Programming. To appear
27. Simons, P., Niemel̈a, I. and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 1-2, 181-234.