Manifold answer-set programs for meta-reasoning

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

Volumn 5753 LNAI, Issue , 2009, Pages 115-128

  Faber, Wolfgang ^a   Woltran, Stefan ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT ARGUMENTATION; ANSWER SET; ANSWER-SET PROGRAMMING; COMPUTATION STEPS; LOGIC PROGRAMS; METAREASONING; NOVEL METHODS; REASONING PROBLEMS;

COMPUTER SCIENCE; LOGIC PROGRAMMING;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

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

References (21)

1. Marek, V.W., Truszczýnski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm - A 25-Year Perspective, pp. 375-398 (1999)
2. Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3-4), 241-273 (1999)
3. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2002)
4. Gelfond, M.: Representing knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.2408, pp. 413-451. Springer, Heidelberg (2002)
5. Gebser,M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczýnski, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.4483, pp. 3-17. Springer, Heidelberg (2007)
6. Bravo, L., Bertossi, L.E.: Logic programs for consistently querying data integration systems. In: IJCAI 2003, pp. 10-15 (2003)
7. Sacc̀a, D.: Multiple total stable models are definitely needed to solve unique solution problems. Inf. Process. Lett. 58(5), 249-254 (1996)
8. Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845-860 (2000)
9. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499-562 (2006)
10. Reiter, R.: On closed world data bases. In: Logic and Databases, pp. 55-76. Plenum Press (1978)
11. Bench-Capon, T.J.M., Dunne, P.E.: Argumentation in artificial intelligence. Artif. Intell. 171(10-15), 619-641 (2007)
12. Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artif. Intell. 171(10-15), 642-674 (2007)
13. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Comput. 9(3/4), 365-386 (1991)
14. Dunne, P.E.: The computational complexity of ideal semantics I: Abstract argumentation frameworks. In: COMMA 2008, pp. 147-158. IOS Press, Amsterdam (2008)
15. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321-358 (1995)
16. Dunne, P.E.: Computational properties of argument systems satisfying graph-theoretic constraints. Artif. Intell. 171(10-15), 701-729 (2007)
17. Osorio,M., Zepeda, C., Nieves, J.C., Cort́es, U.: Inferring acceptable arguments with answer set programming. In: ENC 2005, pp. 198-205 (2005)
18. Egly, U., Gaggl, S., Woltran, S.: Answer-set programming encodings for argumentation frameworks. In: Proceedings ASPOCP 2008 (2008)
19. Eiter, T., Veith, H.: On the complexity of data disjunctions. Theor. Comput. Sci. 288( 101-128 (2002)
20. Delgrande, J.P., Schaub, T.: Reasoning credulously and skeptically within a single extension. Journal of Applied Non-Classical Logics 12(2), 259-285 (2002)
21. Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by metainterpretation in answer set programming. TPLP 3(4-5), 463-498 (2003)