Potassco: The Potsdam Answer Set Solving Collection

This paper gives an overview of the open source project Potassco, the Potsdam Answer Set Solving Collection, bundling tools for Answer Set Programming developed at the University of Potsdam.

[1]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..

[2]  M. Schaefer,et al.  Completeness in the Polynomial-Time Hierarchy A Compendium ∗ , 2008 .

[3]  Martin Gebser,et al.  On the Input Language of ASP Grounder Gringo , 2009, LPNMR.

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

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

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

[7]  Martin Gebser,et al.  Coala: A Compiler from Action Languages to ASP , 2010, JELIA.

[8]  Martin Gebser,et al.  The Conflict-Driven Answer Set Solver clasp: Progress Report , 2009, LPNMR.

[9]  Kevin Leyton-Brown,et al.  SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..

[10]  Nicola Leone,et al.  An ASP-Based System for Team-Building in the Gioia-Tauro Seaport , 2010, PADL.

[11]  Adnan Darwiche,et al.  Complete Algorithms , 2021, Handbook of Satisfiability.

[12]  Tomi Janhunen.  Intermediate Languages of ASP Systems and Tools , 2007 .

[13]  Arthur B. Markman,et al.  Knowledge Representation , 1998 .

[14]  Lawrence Ryan.  Efficient algorithms for clause-learning SAT solvers , 2004 .

[15]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[16]  Robert B. Ross,et al.  Using MPI-2: Advanced Features of the Message Passing Interface , 2003, CLUSTER.

[17]  Torsten Schaub,et al.  Modeling Biological Networks by Action Languages via Answer Set Programming , 2008, Constraints.

[18]  Inês Lynce,et al.  Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.

[19]  Martin Jansche.  Proceedings of the Workshop on Software , 2005 .

[20]  Ofer Strichman,et al.  Local Restarts , 2008, SAT.

[21]  Adnan Darwiche,et al.  A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.

[22]  Michael Gelfond,et al.  Integrating answer set programming and constraint logic programming , 2008, Annals of Mathematics and Artificial Intelligence.

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

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

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

[26]  Martin Gebser,et al.  Advances in gringo Series 3 , 2011, LPNMR.

[27]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[28]  Robert E. Mercer,et al.  On Probing and Multi-Threading in Platypus , 2006, ECAI.

[29]  Martin Gebser,et al.  Solution Enumeration for Projected Boolean Search Problems , 2009, CPAIOR.

[30]  Martin Gebser,et al.  Constraint Answer Set Solving , 2009, ICLP.

[31]  Roberto Ierusalimschy,et al.  Programming in Lua , 2003 .

[32]  Enrico Pontelli,et al.  Issues in parallel execution of non-monotonic reasoning systems , 2005, Parallel Comput..

[33]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

[34]  Ilkka Niemelä,et al.  Bounded LTL model checking with stable models , 2003, Theory Pract. Log. Program..

[35]  Maria Paola Bonacina,et al.  PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems , 1996, J. Symb. Comput..

[36]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[37]  Marius Thomas Lindauer,et al.  A Portfolio Solver for Answer Set Programming: Preliminary Report , 2011, LPNMR.

[38]  Ferhan Türe,et al.  Efficient Haplotype Inference with Answer Set Programming , 2008, AAAI.

[39]  Torsten Schaub,et al.  The System BioC for Reasoning about Biological Models in Action Language C , 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.

[40]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[41]  Martin Gebser,et al.  GrinGo : A New Grounder for Answer Set Programming , 2007, LPNMR.

[42]  Bettina Schnor,et al.  A Simple Distributed Conflict-Driven Answer Set Solver , 2009, LPNMR.

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

[44]  Michael Gelfond,et al.  Answer Sets , 2008, Handbook of Knowledge Representation.

[45]  Michael Gelfond,et al.  Towards an Integration of Answer Set and Constraint Solving , 2005, ICLP.

[46]  Robert E. Mercer,et al.  Platypus: A Platform for Distributed Answer Set Solving , 2005, LPNMR.

[47]  Toby Walsh,et al.  Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .

[48]  Martin Gebser,et al.  Answer Set versus Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems from Real-Time Parallel Programs , 2009, Int. J. Reconfigurable Comput..

[49]  Niklas Sörensson,et al.  Temporal induction by incremental SAT solving , 2003, BMC@CAV.

[50]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[51]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[52]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..

[53]  Martin Gebser,et al.  An incremental answer set programming based system for finite model computation , 2011, AI Commun..

[54]  Martin Gebser,et al.  On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers , 2009, ICLP.

[55]  Marina De Vos,et al.  Automatic Composition of Melodic and Harmonic Music by Answer Set Programming , 2008, ICLP.

[56]  D. Basak,et al.  Support Vector Regression , 2008 .

[57]  Martin Gebser,et al.  clasp : A Conflict-Driven Answer Set Solver , 2007, LPNMR.

[58]  Michael Gelfond,et al.  Integrating Answer Set Reasoning with Constraint Solving Techniques , 2008, FLOPS.

[59]  Enrico Pontelli,et al.  Non-monotonic Reasoning on Beowulf Platforms , 2003, PADL.

[60]  Martin Gebser,et al.  Conflict-Driven Answer Set Enumeration , 2007, LPNMR.

[61]  Toby Walsh,et al.  A translational approach to constraint answer set solving , 2010, Theory Pract. Log. Program..

[62]  Martin Gebser,et al.  Conflict-Driven Disjunctive Answer Set Solving , 2008, KR.

[63]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[64]  Dov M. Gabbay,et al.  What Is Negation as Failure? , 2012, Logic Programs, Norms and Action.

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

[66]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[67]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

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

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

[70]  Vladimir Lifschitz,et al.  Representing Transition Systems by Logic Programs , 1999, LPNMR.

[71]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[72]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

[73]  Martin Gebser,et al.  Detecting Inconsistencies in Large Biological Networks with Answer Set Programming , 2008, ICLP.

[74]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[75]  Martin Gebser,et al.  Reactive Answer Set Programming , 2011, LPNMR.

[76]  Marina De Vos,et al.  ASPVIZ: Declarative Visualisation and Animation Using Answer Set Programming , 2008, ICLP.

[77]  Pascal Van Hentenryck.  Proceedings of the eleventh international conference on Logic programming , 1994 .

[78]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[79]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..

[80]  Martin Gebser,et al.  Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming , 2010, KR.

[81]  Bart Selman,et al.  Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints , 2006, NIPS.

[82]  Toby Walsh,et al.  Symmetry-breaking answer set solving , 2010, AI Commun..

[83]  Alexander A. Razborov,et al.  Why are there so many loop formulas? , 2006, TOCL.

[84]  Bettina Schnor,et al.  Cluster-Based ASP Solving with claspar , 2011, LPNMR.

[85]  Martin Gebser,et al.  Advanced Preprocessing for Answer Set Solving , 2008, ECAI.

[86]  Frank van Harmelen,et al.  Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[87]  Vladimir Lifschitz,et al.  Computing answer sets using program completion , 2003 .

[88]  Bettina Schnor,et al.  Experiences Running a Parallel Answer Set Solver on Blue Gene , 2009, PVM/MPI.

[89]  Martin Gebser,et al.  xpanda : A ( Simple ) Preprocessor for Adding Multi-Valued Propositions to ASP , 2009 .

[90]  Yuliya Lierler,et al.  Answer Set Programming Based on Propositional Satisfiability , 2006, Journal of Automated Reasoning.