The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track
暂无分享,去创建一个
Mario Alviano | Wolfgang Faber | Giovambattista Ianni | Giorgio Terracina | Alessandra Martello | Nicola Leone | Francesco Ricca | Marco Sirianni | Marco Manna | Simona Perri | Pierfrancesco Veltri | Gelsomina Catalano | Francesco Calimeri | Susanna Cozza | Kristian Reale | Claudio Panetta | Onofrio Febbraro | Maria Carmela Santoro | Annamaria Bria | N. Leone | Francesco Calimeri | G. Terracina | F. Ricca | M. Sirianni | Wolfgang Faber | A. Martello | Onofrio Febbraro | Kristian Reale | Mario Alviano | S. Perri | P. Veltri | M. Manna | Giovambattista Ianni | Annamaria Bria | M. Santoro | Susanna Cozza | Gelsomina Catalano | C. Panetta | Alessandra Martello | Claudio Panetta
[1] Jia-Huai You,et al. Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.
[2] Luigi Palopoli,et al. Reasoning with Minimal Models: Efficient Algorithms and Applications , 1997, Artif. Intell..
[3] Jennifer Widom,et al. Database System Implementation , 2000 .
[4] Alessandro Dal Palù,et al. GASP: Answer Set Programming with Lazy Grounding , 2009, Fundam. Informaticae.
[5] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[6] Martin Gebser,et al. Conflict-Driven Answer Set Solving , 2007, IJCAI.
[7] Ilkka Niemelä,et al. Computing Stable Models via Reductions to Difference Logic , 2009, LPNMR.
[8] Thomas Eiter,et al. Distributed Nonmonotonic Multi-Context Systems , 2010, KR.
[9] Martin Gebser,et al. The Conflict-Driven Answer Set Solver clasp: Progress Report , 2009, LPNMR.
[10] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.
[11] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[12] Siegfried Handschuh,et al. Reasoning Web. Semantic Technologies for Information Systems, 5th International Summer School 2009, Brixen-Bressanone, Italy, August 30 - September 4, 2009, Tutorial Lectures , 2009, Reasoning Web.
[13] Wolfgang Faber,et al. Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.
[14] Chitta Baral,et al. Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .
[15] Fangzhen Lin,et al. ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..
[16] Yuliya Lierler,et al. Abstract Answer Set Solvers , 2008, ICLP.
[17] Georg Gottlob,et al. Disjunctive datalog , 1997, TODS.
[18] Georg Gottlob,et al. Default Logic as a Query Language , 1997, IEEE Trans. Knowl. Data Eng..
[19] Giovambattista Ianni,et al. Third ASP Competition File and language formats , 2011 .
[20] Krzysztof R. Apt,et al. Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[21] Martin Gebser,et al. Conflict-Driven Disjunctive Answer Set Solving , 2008, KR.
[22] Yuliya Lierler,et al. Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs , 2004, LPNMR.
[23] Vladimir Lifschitz,et al. Answer Set Planning (Abstract) , 1999, LPNMR.
[24] Manuel V. Hermenegildo,et al. Efficient local unfolding with ancestor stacks* , 2009, Theory and Practice of Logic Programming.
[25] Wolfgang Faber,et al. The DLV system for knowledge representation and reasoning , 2002, TOCL.
[26] Wolfgang Faber,et al. DLV - A System for Declarative Problem Solving , 2000, ArXiv.
[27] Frank Wolter,et al. Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.
[28] Thomas Eiter,et al. Answer Set Programming: A Primer , 2009, Reasoning Web.
[29] Victor W. Marek,et al. Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.
[30] Yuliya Lierler,et al. Disjunctive Answer Set Programming via Satisfiability , 2005, Answer Set Programming.
[31] Ilkka Niemelä,et al. Smodels: A System for Answer Set Programming , 2000, ArXiv.
[32] Bettina Schnor,et al. A Simple Distributed Conflict-Driven Answer Set Solver , 2009, LPNMR.
[33] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.
[34] Wolfgang Faber,et al. Declarative problem-solving using the DLV system , 2000 .
[35] Martin Gebser,et al. Detecting inconsistencies in large biological networks with answer set programming , 2008, Theory and Practice of Logic Programming.
[36] Georg Gottlob,et al. Complexity and expressive power of logic programming , 2001, CSUR.
[37] Martin Gebser,et al. GrinGo : A New Grounder for Answer Set Programming , 2007, LPNMR.
[38] Pascal Nicolas,et al. The First Version of a New ASP Solver : ASPeRiX , 2009, LPNMR.
[39] Tomi Janhunen,et al. Some (in)translatability results for normal logic programs and propositional theories , 2006, J. Appl. Non Class. Logics.
[40] Martin Gebser,et al. The nomore++ Approach to Answer Set Solving , 2005, LPAR.
[41] Wolfgang Faber,et al. Improving Query Optimization for Disjunctive Datalog , 2003, APPIA-GULP-PRODE.
[42] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[43] Michael Gelfond,et al. Logic programming and knowledge representation - The A-Prolog perspective , 2002, Artif. Intell..
[44] Miroslaw Truszczynski,et al. The Second Answer Set Programming Competition , 2009, LPNMR.
[45] Yuliya Lierler,et al. cmodels - SAT-Based Disjunctive Answer Set Solver , 2005, LPNMR.
[46] Ilkka Niemelä,et al. GNT - A Solver for Disjunctive Logic Programs , 2004, LPNMR.
[47] David Maier,et al. Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.
[48] Anil Nerode,et al. Mixed integer programming methods for computing nonmonotonic deductive databases , 1994, JACM.
[49] Mario Alviano,et al. Magic Sets for disjunctive Datalog programs , 2012, Artif. Intell..
[50] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.
[51] Johan Wittocx,et al. The IDP system: A model expansion system for an extension of classical logic , 2008 .
[52] V. S. Subrahmanian,et al. WFS + Branch and Bound = Stable Models , 1995, IEEE Trans. Knowl. Data Eng..
[53] Miroslaw Truszczynski,et al. The First Answer Set Programming System Competition , 2007, LPNMR.