What should an ASP solver output? : a multiple position paper

This position paper raises some issues regarding the output of solvers for Answer Set Programming and discusses experiences made in several different settings. The first set of issues was raised in the context of the first ASP system competition, which led to a first suggestion for a standardised yet miniature output format. We then turn to experiences made in related fields, like Satisfiability Checking, and finally adopt an application point of view by investigating interface issues both with simple tools and in the context of the Semantic Web and query answering.

[1]  Tran Cao Son,et al.  Domain-dependent knowledge in answer set planning , 2002, TOCL.

[2]  Ian Horrocks,et al.  A proposal for an owl rules language , 2004, WWW '04.

[3]  Martin Gebser,et al.  The nomore++ Approach to Answer Set Solving , 2005, LPAR.

[4]  M. Balduccini.  Modules and Signature Declarations for A-Prolog : Progress Report , 2007 .

[5]  Michael Gelfond,et al.  Logic programming and knowledge representation—The A-Prolog perspective , 2002 .

[6]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

[7]  Michael Gelfond,et al.  Going Places: Notes on a Modular Development of Knowledge about Travel , 2006, AAAI Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering.

[8]  Wolfgang Faber,et al.  A backjumping technique for Disjunctive Logic Programming , 2006, AI Commun..

[9]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[10]  Maurice Bruynooghe,et al.  Well-founded and stable semantics of logic programs with aggregates , 2007, Theory Pract. Log. Program..

[11]  T. Syrjänen.  Debugging Inconsistent Answer Set Programs , 2006 .

[12]  Jia-Huai You,et al.  Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.

[13]  Ilkka Niemelä,et al.  Developing a Declarative Rule Language for Applications in Product Configuration , 1999, PADL.

[14]  Henryk Jan Komorowski,et al.  A model and an implementation of a logic programming environment , 1985, SLIPE '85.

[15]  Nicola Leone,et al.  Disjunctive logic programming with types and objects: The DLV+ system , 2007, J. Appl. Log..

[16]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[17]  Miroslaw Truszczynski,et al.  Tools for modeling and solving search problems , 2006, AI Commun..

[18]  Ian Horrocks,et al.  Combining logic programs with description logics , 2003, The Web Conference.

[19]  Tomi Janhunen,et al.  circ2dlp - Translating Circumscription into Disjunctive Logic Programming , 2005, LPNMR.

[20]  Loveleen Kolvekar.  Developing an inference engine for CR-Prolog with preferences , 2004 .

[21]  Georg Gottlob,et al.  The DLV System , 2002, JELIA.

[22]  Wolfgang Faber,et al.  Declarative and Computational Properties of Logic Programs with Aggregates , 2005, IJCAI.

[23]  Michael Gelfond,et al.  Answer set based design of knowledge systems , 2006, Annals of Mathematics and Artificial Intelligence.

[24]  Yuliya Lierler,et al.  Fages' Theorem and Answer Set Programming , 2000, ArXiv.

[25]  Michael Gelfond,et al.  An A Prolog decision support system for the Space Shuttle , 2001, Answer Set Programming.

[26]  Giorgio Terracina,et al.  Adding Efficient Data Management to Logic Programming Systems , 2006, ISMIS.

[27]  C. R. Ramakrishnan,et al.  Justifying proofs using memo tables , 2000, PPDP '00.

[28]  Tomi Janhunen,et al.  Modular Equivalence for Normal Logic Programs , 2006, ECAI.

[29]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[30]  Ilkka Niemelä,et al.  Smodels: A System for Answer Set Programming , 2000, ArXiv.

[31]  Giovambattista Ianni,et al.  External Sources of Computation for Answer Set Solvers , 2005, LPNMR.

[32]  Ilkka Niemelä,et al.  GNT - A Solver for Disjunctive Logic Programs , 2004, LPNMR.

[33]  Wolfgang Faber,et al.  Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity , 2004, JELIA.

[34]  Daniel Bryce,et al.  Planning Graph Heuristics for Belief Space Search , 2006, J. Artif. Intell. Res..

[35]  Yuliya Lierler,et al.  Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs , 2004, LPNMR.

[36]  Enrico Pontelli,et al.  Planning for Biochemical Pathways : A Case Study of Answer Set Planning in Large Planning Problem Instances , 2007 .

[37]  Mary Lynn Heidt.  Developing an inference engine for ASET-Prolog , 2001 .

[38]  Enrico Pontelli,et al.  ASP-PROLOG: a system for reasoning about answer set programs in prolog , 2004, NMR.

[39]  H. Lan,et al.  SWRL : A semantic Web rule language combining OWL and ruleML , 2004 .

[40]  Paul Thagard,et al.  Pathways to Biomedical Discovery , 2003, Philosophy of Science.

[41]  Giovambattista Ianni,et al.  Enhancing answer set programming with templates , 2004, NMR.

[42]  Pasquale Rullo,et al.  Reasoning-Based Knowledge Extraction for Text Classification , 2004, Discovery Science.

[43]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

[44]  Michael Gelfond,et al.  Representing Knowledge in A-Prolog , 2002, Computational Logic: Logic Programming and Beyond.

[45]  Carlo Zaniolo,et al.  Relating Stable Models and AI Planning Domains , 1995, ICLP.

[46]  Gerd Wagner,et al.  Design Rationale for RuleML: A Markup Language for Semantic Web Rules , 2001, SWWS.

[47]  K. Kohn.  Molecular interaction map of the mammalian cell cycle control and DNA repair systems. , 1999, Molecular biology of the cell.

[48]  Chitta Baral,et al.  Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming , 2006, ICLP.

[49]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[50]  Stefan Woltran,et al.  Debugging ASP Programs by Means of ASP , 2007, LPNMR.

[51]  Marc Denecker,et al.  The Well-Founded Semantics Is the Principle of Inductive Definition , 1998, JELIA.

[52]  Als-Nscort.  Eclipse Platform Technical Overview , 2003 .

[53]  Ilkka Niemelä,et al.  Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking , 2000, Computational Logic.

[54]  Peter J. Stuckey,et al.  Semantics of Logic Programs with Aggregates , 1991, ISLP.

[55]  Ilkka Niemelä,et al.  WASP WP3 Report: Language Extensions and Software Engineering for ASP , 2005 .

[56]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[57]  Tomi Janhunen,et al.  Some (in)translatability results for normal logic programs and propositional theories , 2006, J. Appl. Non Class. Logics.

[58]  Pasquale Rullo,et al.  OLEX - A Reasoning-Based Text Classifier , 2004, JELIA.

[59]  Enrico Pontelli,et al.  Planning with preferences using logic programming , 2004, Theory and Practice of Logic Programming.

[60]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[61]  Ian Horrocks,et al.  Description logic programs: combining logic programs with description logic , 2003, WWW '03.

[62]  Gerald Pfeifer,et al.  Enhancing disjunctive logic programming systems by SAT checkers , 2003, Artif. Intell..

[63]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[64]  Fangzhen Lin,et al.  ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..

[65]  Marina De Vos,et al.  Debugging Logic Programs under the Answer Set Semantics , 2005, Answer Set Programming.

[66]  Francesco Buccafurri,et al.  Enhancing Disjunctive Datalog by Constraints , 2000, IEEE Trans. Knowl. Data Eng..

[67]  Georg Gottlob,et al.  Modular Logic Programming and Generalized Quantifiers , 1997, LPNMR.

[68]  Hudson Turner,et al.  Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach , 1997, J. Log. Program..

[69]  Michael Gelfond,et al.  Enhancing ASP systems for planning with temporal constraints , 2007, ICLP 2007.

[70]  Enrico Pontelli,et al.  Justification and debugging of answer set programs in ASP , 2005, AADEBUG'05.

[71]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[72]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[73]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[74]  E. Coiera.  Interaction Design , 2002 .

[75]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[76]  Yuliya Lierler.  Cmodels for Tight Disjunctive Logic Programs , 2005, WLP.

[77]  Giovambattista Ianni,et al.  A System with Template Answer Set Programs , 2004, JELIA.

[78]  Dieter Maurer,et al.  Compiler Design , 2013, Springer Berlin Heidelberg.

[79]  Miroslaw Truszczynski,et al.  Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative , 2004, LPNMR.

[80]  Wolfgang Faber,et al.  The INFOMIX system for advanced integration of incomplete and inconsistent data , 2005, SIGMOD '05.

[81]  Marc Denecker,et al.  Extending Classical Logic with Inductive Definitions , 2000, Computational Logic.

[82]  A Sureshkumar,et al.  AnsProlog* Programming Environment (APE): Investigating software tools for answer set programming through the implementation of an integrated development environment , 2006 .

[83]  Günther Specht.  Generating Explanation Trees even for Negations in Deductive DataBase Systems , 1993, LPE.

[84]  Francesco Buccafurri,et al.  Stable Models and Their Computation for Logic Programming with Inheritance and True Negation , 1996, J. Log. Program..

[85]  Miroslaw Truszczynski,et al.  The First Answer Set Programming System Competition , 2007, LPNMR.

[86]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[87]  Enrico Pontelli,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming Justifications for Logic Programs under Answer Set Semantics , 2022 .

[88]  Ilkka Niemelä,et al.  Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs , 2002, JELIA.

[89]  Giridhar Pemmasani,et al.  Online Justification for Tabled Logic Programs , 2003, FLOPS.

[90]  Hans Tompits,et al.  A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.

[91]  Hans Tompits,et al.  A framework for compiling preferences in logic programs , 2002, Theory and Practice of Logic Programming.

[92]  Marco Manna,et al.  A Logic-Based Approach to Semantic Information Extraction , 2006, ICEIS.

[93]  Laurent Simon,et al.  Preface to the Special Volume on the SAT 2005 Competitions and Evaluations , 2006, J. Satisf. Boolean Model. Comput..

[94]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

[95]  Nicholas Gianoutsos.  Detecting suspicious input in intelligent systems using answer set programming , 2005 .

[96]  Enrico Pontelli,et al.  A Tool for Knowledge Base Integration and Querying , 2006, AAAI Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering.

[97]  Alan L. Selman,et al.  A Taxonomy of Complexity Classes of Functions , 1994, J. Comput. Syst. Sci..

[98]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[99]  Michael Gelfond,et al.  Diagnostic reasoning with A-Prolog , 2003, Theory Pract. Log. Program..

[100]  Ron Y. Pinter,et al.  An environment for logic programming , 1985, SLIPE '85.

[101]  Eugenia Ternovska,et al.  A Logic for Non-Monotone Inductive Definitions , 2005, ArXiv.

[102]  Tran Cao Son,et al.  Approximation of action theories and its application to conformant planning , 2005, Artif. Intell..

[103]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[104]  Geoff Sutcliffe,et al.  CASC-J3 - The 3rd IJCAR ATP System Competition , 2006, IJCAR.

[105]  Nicola Leone,et al.  Exploiting ASP for Semantic Information Extraction , 2005, Answer Set Programming.

[106]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[107]  Veena S. Mellarkod,et al.  Optimizing the computation of stable models using merged rules , 2002 .

[108]  Miroslaw Truszczynski,et al.  Predicate-calculus-based logics for modeling and solving search problems , 2006, TOCL.