article

Potassco: The Potsdam Answer Set Solving Collection

Authors:

Marius SchneiderAuthors Info & Claims

AI Communications, Volume 24, Issue 2

Pages 107 - 124

Published: 01 April 2011 Publication History

Abstract

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.

References

[1]

S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases, Addison-Wesley, 1995.

Digital Library

Google Scholar

[2]

K. Apt, H. Blair and A. Walker, Towards a theory of declarative knowledge, in: Foundations of Deductive Databases and Logic Programming, J. Minker, ed., Morgan Kaufmann Publishers, 1987, pp. 89-148, Chapter 2.

Crossref

Google Scholar

[3]

Y. Babovich and V. Lifschitz, Computing answer sets using program completion, Unpublished draft, 2003, available at: http://www.cs.utexas.edu/users/tag/cmodels.html.

Google Scholar

[4]

M. Balduccini, E. Pontelli, O. El-Khatib and H. Le, Issues in parallel execution of non-monotonic reasoning systems, Parallel Computing 31(6) (2005), 608-647.

Crossref

Google Scholar

[5]

C. Baral, Knowledge Representation, Reasoning and Declarative Problem Solving, Cambridge Univ. Press, 2003.

Crossref

Google Scholar

[6]

C. Baral, G. Brewka and J. Schlipf (eds), Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), Lecture Notes in Artificial Intelligence, Vol. 4483, Springer-Verlag, 2007.

Digital Library

Google Scholar

[7]

D. Basak, S. Pal and D. Patranabis, Support vector regression, Neural Information Processing - Letters and Reviews 11(10) (2007).

Google Scholar

[8]

S. Baselice, P. Bonatti and M. Gelfond, Towards an integration of answer set and constraint solving, in: Proceedings of the Twenty-First International Conference on Logic Programming (ICLP'05), M. Gabbrielli and G. Gupta, eds, Lecture Notes in Computer Science, Vol. 3668, Springer-Verlag, 2005, pp. 52-66.

Digital Library

Google Scholar

[9]

A. Biere, M. Heule, H. van Maaren and T. Walsh, Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, Vol. 185, IOS Press, 2009.

Crossref

Google Scholar

[10]

G. Boenn, M. Brain, M. de Vos and J. Fitch, Automatic composition of melodic and harmonic music by answer set programming, in: Proceedings of the Twenty-Fourth International Conference on Logic Programming (ICLP'08), Lecture Notes in Computer Science, Vol. 5366, Springer-Verlag, 2008, pp. 160-174.

Crossref

Google Scholar

[11]

T. Bylander, The computational complexity of propositional STRIPS planning, Artificial Intelligence 69(1,2) (1994), 165- 204.

Digital Library

Google Scholar

[12]

K. Clark, Negation as failure, in: Logic and Data Bases, H. Gallaire and J. Minker, eds, Plenum Press, 1978, pp. 293- 322.

Google Scholar

[13]

O. Cliffe, M. de Vos, M. Brain and J. Padget, ASPVIZ: Declarative visualisation and animation using answer set programming, in: Proceedings of the Twenty-Fourth International Conference on Logic Programming (ICLP'08), Lecture Notes in Computer Science, Vol. 5366, Springer-Verlag, 2008, pp. 724-728.

Digital Library

Google Scholar

[14]

E. Dantsin, T. Eiter, G. Gottlob and A. Voronkov, Complexity and expressive power of logic programming, ACM Computing Surveys 33(3) (2001), 374-425.

Crossref

Google Scholar

[15]

A. Darwiche and K. Pipatsrisawat, Complete algorithms, in: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, Vol. 185, IOS Press, 2009, pp. 99-130, Chapter 3.

Google Scholar

[16]

M. de Vos and T. Schaub (eds), Proceedings of the Workshop on Software Engineering for Answer Set Programming (SEA'07), Department of Computer Science, University of Bath, Technical Report Series, 2007.

Google Scholar

[17]

M. de Vos and T. Schaub (eds), Proceedings of the Second Workshop on Software Engineering for Answer Set Programming (SEA'09), Department of Computer Science, University of Bath, Technical Report Series, 2009.

Google Scholar

[18]

J. Delgrande and W. Faber (eds), Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), Lecture Notes in Artificial Intelligence, Springer-Verlag, 2011, to appear.

Digital Library

Google Scholar

[19]

R. Dechter, Constraint Processing, Morgan Kaufmann, 2003.

Crossref

Google Scholar

[20]

C. Drescher, M. Gebser, T. Grote, B. Kaufmann, A. König, M. Ostrowski and T. Schaub, Conflict-driven disjunctive answer set solving, in: Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR'08), G. Brewka and J. Lang, eds, AAAI Press, 2008, pp. 422-432.

Google Scholar

[21]

C. Drescher, O. Tifrea and T. Walsh, Symmetry-breaking answer set solving, in: Proceedings of ICLP'10 Workshop on Answer Set Programming and Other Computing Paradigm, M. Balduccini and S. Woltran, eds, 2010.

Google Scholar

[22]

C. Drescher and T. Walsh, A translational approach to constraint answer set solving, Theory and Practice of Logic Programming 10(4-6) (2010), 465-480, Special Issue: Twenty-Sixth International Conference on Logic Programming (ICLP'10).

Crossref

Google Scholar

[23]

S. Dworschak, S. Grell, V. Nikiforova, T. Schaub and J. Selbig, Modeling biological networks by action languages via answer set programming, Constraints 13(1,2) (2008), 21-65.

Crossref

Google Scholar

[24]

S. Dworschak, T. Grote, A. König, T. Schaub and P. Veber, The system BioC for reasoning about biological models in action language C, in: Proceedings of the Twentieth International Conference on Tools with Artificial Intelligence (ICTAI' 08), Vol. 1, IEEE Computer Society, 2008, pp. 11-18.

Digital Library

Google Scholar

[25]

N. Eén and A. Biere, Effective preprocessing in SAT through variable and clause elimination, in: Proceedings of the Eigth International Conference on Theory and Applications of Satisfiability Testing (SAT'05), F. Bacchus and T. Walsh, eds, Lecture Notes in Computer Science, Vol. 3569, Springer-Verlag, 2005, pp. 61-75.

Digital Library

Google Scholar

[26]

N. Eén and N. Sörensson, Temporal induction by incremental SAT solving, Electronic Notes in Theoretical Computer Science 89(4) (2003).

Google Scholar

[27]

N. Eén and N. Sörensson, An extensible SAT-solver, in: E. Giunchiglia and A. Tacchella, eds, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), Lecture Notes in Computer Science, Vol. 2919, Springer-Verlag, 2004, pp. 502-518.

Crossref

Google Scholar

[28]

E. Ellguth, M. Gebser, M. Gusowski, R. Kaminski, B. Kaufmann, S. Liske, T. Schaub, L. Schneidenbach and B. Schnor, A simple distributed conflict-driven answer set solver, in: Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), Lecture Notes in Artificial Intelligence, Vol. 5753, Springer-Verlag, 2009, pp. 490-495.

Digital Library

Google Scholar

[29]

E. Erdem, F. Lin and T. Schaub (eds), Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), Lecture Notes in Artificial Intelligence, Vol. 5753, Springer-Verlag, 2009.

Crossref

Google Scholar

[30]

E. Erdem and F. Türe, Efficient haplotype inference with answer set programming, in: Proceedings of the Twenty-Third National Conference on Artificial Intelligence (AAAI'08), D. Fox and C. Gomes, eds, AAAI Press, 2008, pp. 436-441.

Crossref

Google Scholar

[31]

F. Fages, Consistency of Clark's completion and the existence of stable models, Journal of Methods of Logic in Computer Science 1 (1994), 51-60.

Google Scholar

[32]

J. Freeman, Improvements to propositional satisfiability search algorithms, PhD thesis, University of Pennsylvania, 1995.

Digital Library

Google Scholar

[33]

M. Garcia de la Banda and E. Pontelli (eds), Proceedings of the Twenty-Fourth International Conference on Logic Programming (ICLP'08), Lecture Notes in Computer Science, Vol. 5366, Springer-Verlag, 2008.

Google Scholar

[34]

M. Gebser, T. Grote, R. Kaminski and T. Schaub, Reactive answer set programming, in: Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), Lecture Notes in Artificial Intelligence, Springer-Verlag, 2011, to appear.

Digital Library

Google Scholar

[35]

M. Gebser, T. Grote and T. Schaub, Coala: A compiler from action languages to ASP, in: Proceedings of the Twelfth European Conference on Logics in Artificial Intelligence (JELIA'10), Lecture Notes in Artificial Intelligence, Vol. 6341, Springer-Verlag, 2010.

Crossref

Google Scholar

[36]

M. Gebser, C. Guziolowski, M. Ivanchev, T. Schaub, A. Siegel, S. Thiele and P. Veber, Repair and prediction (under inconsistency) in large biological networks with answer set programming, in: Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR'10), F. Lin and U. Sattler, eds, AAAI Press, 2010, pp. 497-507.

Google Scholar

[37]

M. Gebser, H. Hinrichs, T. Schaub and S. Thiele, xpanda: A (simple) preprocessor for adding multi-valued propositions to ASP, in: Proceedings of the Twenty-Third Workshop on (Constraint) Logic Programming (WLP'09), U. Geske and A. Wolf, eds, 2009.

Google Scholar

[38]

M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub and S. Thiele, A user's guide to gringo, clasp, clingo, and iclingo, available at: http://potassco. sourceforge.net.

Google Scholar

[39]

M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub and S. Thiele, Engineering an incremental ASP solver, in: Proceedings of the Twenty-Fourth International Conference on Logic Programming (ICLP'08), Lecture Notes in Computer Science, Vol. 5366, Springer-Verlag, 2008.

Digital Library

Google Scholar

[40]

M. Gebser, R. Kaminski, B. Kaufmann and T. Schaub, On the implementation of weight constraint rules in conflict-driven ASP solvers, in: Proceedings of the Twenty-Fifth International Conference on Logic Programming (ICLP'09), Lecture Notes in Computer Science, Vol. 5649, Springer-Verlag, 2009.

Digital Library

Google Scholar

[41]

M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, M. Schneider and S. Ziller, A portfolio solver for answer set programming: Preliminary report, in: Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), Lecture Notes in Artificial Intelligence, Springer-Verlag, 2011, to appear.

Digital Library

Google Scholar

[42]

M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub and B. Schnor, Cluster-based asp solving with claspar, in: Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), Lecture Notes in Artificial Intelligence, Springer-Verlag, 2011, to appear.

Digital Library

Google Scholar

[43]

M. Gebser, R. Kaminski, M. Knecht and T. Schaub, plasp: A compiler from PDDL to ASP, in: Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), Lecture Notes in Artificial Intelligence, Springer-Verlag, 2011, to appear.

Google Scholar

[44]

M. Gebser, R. Kaminski, A. König and T. Schaub, Advances in gringo series 3, in: Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), Lecture Notes in Artificial Intelligence, Springer-Verlag, 2011, to appear.

Digital Library

Google Scholar

[45]

M. Gebser, R. Kaminski, M. Ostrowski, T. Schaub and S. Thiele, On the input language of ASP grounder gringo, in: Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), Lecture Notes in Artificial Intelligence, Vol. 5753, Springer-Verlag, 2009, pp. 502-508.

Digital Library

Google Scholar

[46]

M. Gebser, B. Kaufmann, A. Neumann and T. Schaub, clasp: A conflict-driven answer set solver, in: Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), Lecture Notes in Artificial Intelligence, Vol. 4483, Springer-Verlag, 2007, pp. 260-265.

Crossref

Google Scholar

[47]

M. Gebser, B. Kaufmann, A. Neumann and T. Schaub, Conflict-driven answer set enumeration, in: Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), Lecture Notes in Artificial Intelligence, Vol. 4483, Springer-Verlag, 2007, pp. 136-148.

Crossref

Google Scholar

[48]

M. Gebser, B. Kaufmann, A. Neumann and T. Schaub, Conflict-driven answer set solving, in: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), M. Veloso, ed., AAAI Press/MIT Press, 2007, pp. 386-392.

Crossref

Google Scholar

[49]

M. Gebser, B. Kaufmann, A. Neumann and T. Schaub, Advanced preprocessing for answer set solving, in: Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAI'08), M. Ghallab, C. Spyropoulos, N. Fakotakis and N. Avouris, eds, IOS Press, 2008, pp. 15-19.

Crossref

Google Scholar

[50]

M. Gebser, B. Kaufmann and T. Schaub, The conflict-driven answer set solver clasp: Progress report, in: Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), Lecture Notes in Artificial Intelligence, Vol. 5753, Springer-Verlag, 2009.

Digital Library

Google Scholar

[51]

M. Gebser, B. Kaufmann and T. Schaub, Solution enumeration for projected Boolean search problems, in: Proceedings of the Sixth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), W. vanHoeve and J. Hooker, eds, Lecture Notes in Computer Science, Vol. 5547, Springer-Verlag, 2009, pp. 71-86.

Digital Library

Google Scholar

[52]

M. Gebser, M. Ostrowski and T. Schaub, Constraint answer set solving, in: Proceedings of the Twenty-Fifth International Conference on Logic Programming (ICLP'09), Lecture Notes in Computer Science, Vol. 5649, Springer-Verlag, 2009, pp. 235-249.

Digital Library

Google Scholar

[53]

M. Gebser, O. Sabuncu and T. Schaub, An incremental answer set programming based system for finite model computation, in: Proceedings of the Twelfth European Conference on Logics in Artificial Intelligence (JELIA'10), Lecture Notes in Artificial Intelligence, Vol. 6341, Springer-Verlag, 2010, pp. 169-181.

Crossref

Google Scholar

[54]

M. Gebser, T. Schaub and S. Thiele, Gringo: A new grounder for answer set programming, in: Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), Lecture Notes in Artificial Intelligence, Vol. 4483, Springer-Verlag, 2007, pp. 266- 271.

Crossref

Google Scholar

[55]

M. Gebser, T. Schaub, S. Thiele and P. Veber, Detecting inconsistencies in large biological networks with answer set programming, Theory and Practice of Logic Programming 11(2) (2011), 1-38.

Crossref

Google Scholar

[56]

Gecode: Generic constraint development environment, 2006, available at: http://www.gecode.org.

Google Scholar

[57]

M. Gelfond, Answer sets, in: Handbook of Knowledge Representation, V. Lifschitz, F. van Hermelen and B. Porter, eds, Elsevier, 2008, pp. 285-316, Chapter 7.

Google Scholar

[58]

M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP'88), R. Kowalski and K. Bowen, eds, MIT Press, 1988, pp. 1070-1080.

Google Scholar

[59]

M. Gelfond and V. Lifschitz, Action languages, Electronic Transactions on Artificial Intelligence 3(6) (1998), 193-210.

Google Scholar

[60]

E. Giunchiglia, J. Lee, V. Lifschitz, N. McCain and H. Turner, Nonmonotonic causal theories, Artificial Intelligence 153(1,2) (2004), 49-104.

Crossref

Google Scholar

[61]

E. Giunchiglia, Y. Lierler and M. Maratea, Answer set programming based on propositional satisfiability, Journal of Automated Reasoning 36(4) (2006), 345-377.

Digital Library

Google Scholar

[62]

E. Goldberg and Y. Novikov, BerkMin: A fast and robust SAT solver, in: Proceedings of the Fifth Conference on Design, Automation and Test in Europe (DATE'02), IEEE Press, 2002, pp. 142-149.

Crossref

Google Scholar

[63]

C. Gomes, A. Sabharwal and B. Selman, Near-uniform sampling of combinatorial spaces using XOR constraints, in: Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems (NIPS'06), B. Schölkopf, J. Platt and T. Hoffman, eds, MIT Press, 2006, pp. 481-488.

Google Scholar

[64]

G. Grasso, S. Iiritano, N. Leone, V. Lio, F. Ricca and F. Scalise, An ASP-based system for team-building in the Gioia-Tauro seaport, in: Proceedings of the Twelfth International Symposium on Practical Aspects of Declarative Languages (PADL'10), M. Carro and R. Peña, eds, Lecture Notes in Computer Science, Vol. 5937, Springer-Verlag, 2010, pp. 40-42.

Digital Library

Google Scholar

[65]

J. Gressmann, T. Janhunen, R. Mercer, T. Schaub, S. Thiele and R. Tichy, Platypus: A platform for distributed answer set solving, in: Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05), C. Baral, G. Greco, N. Leone and G. Terracina, eds, Lecture Notes in Artificial Intelligence, Vol. 3662, Springer-Verlag, 2005, pp. 227-239.

Digital Library

Google Scholar

[66]

J. Gressmann, T. Janhunen, R. Mercer, T. Schaub, S. Thiele and R. Tichy, On probing and multi-threading in platypus, in: Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI'06), G. Brewka, S. Coradeschi, A. Perini and P. Traverso, eds, IOS Press, 2006, pp. 392-396.

Crossref

Google Scholar

[67]

W. Gropp, E. Lusk and R. Thakur, Using MPI-2: Advanced Features of the Message-Passing Interface, MIT Press, 1999.

Digital Library

Google Scholar

[68]

K. Heljanko and I. Niemelä, Bounded LTL model checking with stable models, Theory and Practice of Logic Programming 3(4,5) (2003), 519-550.

Crossref

Google Scholar

[69]

P. Hill and D. Warren (eds), Proceedings of the Twenty-Fifth International Conference on Logic Programming (ICLP'09), Lecture Notes in Computer Science, Vol. 5649, Springer-Verlag, 2009.

Crossref

Google Scholar

[70]

R. Ierusalimschy, Programming in Lua, 2006, available at: lua.org.

Crossref

Google Scholar

[71]

H. Ishebabi, P. Mahr, C. Bobda, M. Gebser and T. Schaub, Answer set vs integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs, Journal of Reconfigurable Computing, 2009, Article ID 863630.

Crossref

Google Scholar

[72]

T. Janhunen, Intermediate languages of ASP systems and tools, in: Proceedings of the Workshop on Software Engineering for Answer Set Programming (SEA'07), Department of Computer Science, University of Bath, Technical Report Series, 2007, pp. 12-25.

Google Scholar

[73]

T. Janhunen and I. Niemelä (eds), Proceedings of the Twelfth European Conference on Logics in Artificial Intelligence (JELIA'10), Lecture Notes in Artificial Intelligence, Vol. 6341, Springer-Verlag, 2010.

Crossref

Google Scholar

[74]

M. Knecht, Efficient domain-independent planning using declarative programming, MSc thesis, Institute for Informatics, University of Potsdam, 2009.

Google Scholar

[75]

N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri and F. Scarcello, The DLV system for knowledge representation and reasoning, ACM Transactions on Computational Logic 7(3) (2006), 499-562.

Digital Library

Google Scholar

[76]

V. Lifschitz, Answer set programming and plan generation, Artificial Intelligence 138(1,2) (2002), 39-54.

Digital Library

Google Scholar

[77]

V. Lifschitz and A. Razborov, Why are there so many loop formulas?, ACM Transactions on Computational Logic 7(2) (2006), 261-268.

Digital Library

Google Scholar

[78]

V. Lifschitz and H. Turner, Representing transition systems by logic programs, in: Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), M. Gelfond, N. Leone and G. Pfeifer, eds, Lecture Notes in Artificial Intelligence, Vol. 1730, Springer-Verlag, 1999, pp. 92-106.

Crossref

Google Scholar

[79]

V. Lifschitz, F. van Hermelen and B. Porter (eds), Handbook of Knowledge Representation, Elsevier, 2008.

Crossref

Google Scholar

[80]

F. Lin and Y. Zhao, ASSAT: computing answer sets of a logic program by SAT solvers, Artificial Intelligence 157(1,2) (2004), 115-137.

Crossref

Google Scholar

[81]

J. Marques-Silva, I. Lynce and S. Malik, Conflict-driven clause learning SAT solvers, in: Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications, Vol. 185, IOS Press, 2009, pp. 131-153, Chapter 4.

Google Scholar

[82]

V. Mellarkod and M. Gelfond, Integrating answer set reasoning with constraint solving techniques, in: Proceedings of the Ninth International Symposium on Functional and Logic Programming (FLOPS'08), J. Garrigue and M. Hermenegildo, eds, Lecture Notes in Computer Science, Vol. 4989, Springer-Verlag, 2008, pp. 15-31.

Crossref

Google Scholar

[83]

V. Mellarkod, M. Gelfond and Y. Zhang, Integrating answer set programming and constraint logic programming, Annals of Mathematics and Artificial Intelligence 53(1-4) (2008), 251-287.

Digital Library

Google Scholar

[84]

M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, Chaff: Engineering an efficient SAT solver, in: Proceedings of the Thirty-Eighth Conference on Design Automation (DAC'01), ACM Press, 2001, pp. 530-535.

Crossref

Google Scholar

[85]

R. Nieuwenhuis, A. Oliveras and C. Tinelli, Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T), Journal of the ACM 53(6) (2006), 937-977.

Crossref

Google Scholar

[86]

M. Nogueira, M. Balduccini, M. Gelfond, R. Watson and M. Barry, An A-prolog decision support system for the space shuttle, in: Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages (PADL'01), I. Ramakrishnan, ed., Lecture Notes in Computer Science, Vol. 1990, Springer-Verlag, 2001, pp. 169-183.

Crossref

Google Scholar

[87]

K. Pipatsrisawat and A. Darwiche, A lightweight component caching scheme for satisfiability solvers, in: Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT'07), J. Marques-Silva and K. Sakallah, eds, Lecture Notes in Computer Science, Vol. 4501, Springer-Verlag, 2007, pp. 294-299.

Crossref

Google Scholar

[88]

E. Pontelli, M. Balduccini and F. Bermudez, Nonmonotonic reasoning on Beowulf platforms, in: Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL'03), V. Dahl and P. Wadler, eds, Lecture Notes in Artificial Intelligence, Vol. 2562, Springer-Verlag, 2003, pp. 37-57.

Crossref

Google Scholar

[89]

F. Rossi, P. van Beek and T. Walsh (eds), Handbook of Constraint Programming, Elsevier, 2006.

Crossref

Google Scholar

[90]

L. Ryan, Efficient algorithms for clause-learning SAT solvers, Master's thesis, Simon Fraser University, 2004.

Google Scholar

[91]

V. Ryvchin and O. Strichman, Local restarts, in: Proceedings of the Eleventh International Conference on Theory and Applications of Satisfiability Testing (SAT'08), H. Kleine Bün ing and X. Zhao, eds, Lecture Notes in Computer Science, Vol. 4996, Springer-Verlag, 2008, pp. 271-276.

Crossref

Google Scholar

[92]

M. Schaefer and C. Umans, Completeness in the polynomial-time hierarchy: A compendium, ACM SIGACT News 33(3) (2002), 32-49, updated version available at: http://ovid.cs. depaul.edu/documents/phcom.ps.

Google Scholar

[93]

J. Schlipf, The expressive powers of the logic programming semantics, Journal of Computer and System Sciences 51 (1995), 64-86.

Digital Library

Google Scholar

[94]

L. Schneidenbach, B. Schnor, M. Gebser, R. Kaminski, B. Kaufmann and T. Schaub, Experiences running a parallel answer set solver on Blue Gene, in: Proceedings of the Sixteenth European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (PVM/MPI'09), M. Ropo, J. Westerholm and J. Dongarra, eds, Lecture Notes in Computer Science, Vol. 5759, Springer-Verlag, 2009, pp. 64-72.

Digital Library

Google Scholar

[95]

P. Simons, I. Niemelä and T. Soininen, Extending and implementing the stable model semantics, Artificial Intelligence 138(1,2) (2002), 181-234.

Crossref

Google Scholar

[96]

T. Soininen and I. Niemelä, Developing a declarative rule language for applications in product configuration, in: Proceedings of the First International Workshop on Practical Aspects of Declarative Languages (PADL'99), G. Gupta, ed., Lecture Notes in Computer Science, Vol. 1551, Springer-Verlag, 1999, pp. 305-319.

Crossref

Google Scholar

[97]

T. Son, C. Baral, T. Nam and S. McIlraith, Domain-dependent knowledge in answer set planning, ACM Transactions on Computational Logic 7(4) (2006), 613-657.

Digital Library

Google Scholar

[98]

T. Syrjänen, Lparse 1.0 user's manual, available at: http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz.

Google Scholar

[99]

L. Xu, F. Hutter, H. Hoos and K. Leyton-Brown, SATzilla: Portfolio-based algorithm selection for SAT, Journal of Artificial Intelligence Research 32 (2008), 565-606.

Digital Library

Google Scholar

[100]

H. Zhang, M. Bonacina and J. Hsiang, PSATO: a distributed propositional prover and its application to quasigroup problems, Journal of Symbolic Computation 21(4) (1996), 543- 560.

Digital Library

Google Scholar

Cited By

View all

Hofmann TGeffner HLarson K(2024)Learning generalized policies for fully observable non-deterministic planning domainsProceedings of the Thirty-Third International Joint Conference on Artificial Intelligence10.24963/ijcai.2024/744(6733-6742)Online publication date: 3-Aug-2024
https://dl.acm.org/doi/10.24963/ijcai.2024/744
Trinh GBenhamou BPastva SSoliman SWooldridge MDy JNatarajan S(2024)Scalable enumeration of trap spaces in boolean networks via answer set programmingProceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence and Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence and Fourteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v38i9.28943(10714-10722)Online publication date: 20-Feb-2024
https://dl.acm.org/doi/10.1609/aaai.v38i9.28943
Heroux MHeroux MMcInnes LAhrens JGamblin TGermann TLi XMohror KMunson TShende SThakur RVetter JWillenbring J(2024)ECP libraries and toolsInternational Journal of High Performance Computing Applications10.1177/1094342024127100538:5(381-408)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1177/10943420241271005
Show More Cited By

Potassco: The Potsdam Answer Set Solving Collection
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning

Recommendations

Coordination in answer set programming

This article studies a semantics of multiple logic programs, and synthesizes a program having such a collective semantics. More precisely, the following two problems are considered: given two logic programs P₁ and P₂, which have the collections of ...
Personalized Course Schedule Planning Using Answer Set Programming
Practical Aspects of Declarative Languages
Abstract
Course scheduling or timetabling is a well-known problem that is generally studied from the perspective of schools; the goal is to schedule the courses, considering, e.g., the expected number of students, the sizes of the available classrooms, ...
FLP answer set semantics without circular justifications for general logic programs

The answer set semantics presented by Faber et al. [27] has been widely used to define so called FLP answer sets for different types of logic programs. However, it was recently observed that when being extended from normal to more general classes of ...

Comments

Information & Contributors

Information

Published In

AI Communications Volume 24, Issue 2

Answer Set Programming

April 2011

106 pages

ISSN:0921-7126

Issue’s Table of Contents

Publisher

IOS Press

Netherlands

Publication History

Published: 01 April 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

111
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hofmann TGeffner HLarson K(2024)Learning generalized policies for fully observable non-deterministic planning domainsProceedings of the Thirty-Third International Joint Conference on Artificial Intelligence10.24963/ijcai.2024/744(6733-6742)Online publication date: 3-Aug-2024
https://dl.acm.org/doi/10.24963/ijcai.2024/744
Trinh GBenhamou BPastva SSoliman SWooldridge MDy JNatarajan S(2024)Scalable enumeration of trap spaces in boolean networks via answer set programmingProceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence and Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence and Fourteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v38i9.28943(10714-10722)Online publication date: 20-Feb-2024
https://dl.acm.org/doi/10.1609/aaai.v38i9.28943
Heroux MHeroux MMcInnes LAhrens JGamblin TGermann TLi XMohror KMunson TShende SThakur RVetter JWillenbring J(2024)ECP libraries and toolsInternational Journal of High Performance Computing Applications10.1177/1094342024127100538:5(381-408)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1177/10943420241271005
Luo ZXiong KZhu JChen RShu XWeng DWu Y(2024)Ferry: Toward Better Understanding of Input/Output Space for Data Wrangling ScriptsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345632831:1(1202-1212)Online publication date: 10-Sep-2024
https://dl.acm.org/doi/10.1109/TVCG.2024.3456328
Nichols DMenon HGamblin TBhatele A(2024)A Probabilistic Approach To Selecting Build Configurations in Package ManagersProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC41406.2024.00090(1-13)Online publication date: 17-Nov-2024
https://dl.acm.org/doi/10.1109/SC41406.2024.00090
Pinckney DCassano FGuha ABell JCulpo MGamblin TGrundy JPollock LPenta M(2023)Flexible and Optimal Dependency Management via Max-SMTProceedings of the 45th International Conference on Software Engineering10.1109/ICSE48619.2023.00124(1418-1429)Online publication date: 14-May-2023
https://dl.acm.org/doi/10.1109/ICSE48619.2023.00124
Gamblin TCulpo MBecker GShudler SWolf FShende SCulhane CAlam SJagode H(2022)Using answer set programming for HPC dependency solvingProceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis10.5555/3571885.3571931(1-15)Online publication date: 13-Nov-2022
https://dl.acm.org/doi/10.5555/3571885.3571931
Lapeyrade SWare SEger M(2022)Reasoning with ontologies for non-player character's decision-making in gamesProceedings of the Eighteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment10.1609/aiide.v18i1.21980(303-306)Online publication date: 24-Oct-2022
https://dl.acm.org/doi/10.1609/aiide.v18i1.21980
Cooper SWare SEger M(2022)SturgeonProceedings of the Eighteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment10.1609/aiide.v18i1.21944(26-36)Online publication date: 24-Oct-2022
https://dl.acm.org/doi/10.1609/aiide.v18i1.21944
Menon HParasyris KScogland TGamblin TLo DMcIntosh SNovielli N(2022)Searching for high-fidelity builds using active learningProceedings of the 19th International Conference on Mining Software Repositories10.1145/3524842.3528464(179-190)Online publication date: 23-May-2022
https://dl.acm.org/doi/10.1145/3524842.3528464
Show More Cited By

Abstract

References

Cited By

Recommendations

Coordination in answer set programming

Personalized Course Schedule Planning Using Answer Set Programming

FLP answer set semantics without circular justifications for general logic programs

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations