Boenn, G., Brain, M., Vos, M.D. and Fitch, J. Automatic music composition using answer set programming. Theory and Practice of Logic Programming 11, 2--3 (2011), 397--427.

Digital Library

Google Scholar

[5]

Brain, M. and Vos, M.D. Debugging logic programs under the answer set semantics. In Proc. 3rd International Workshop on Answer Set Programming, CEUR Workshop Proceedings 142, 2005. M. De Vos and A. Provetti, Eds.

Google Scholar

[6]

Brewka, G., Niemelä, I. and Truszczyński, M. Answer set optimization. In Proc. 18th International Joint Conference on Artificial Intelligence. G. Gottlob and T.Walsh, Eds. Morgan Kaufmann, 2003, 867--872.

Digital Library

Google Scholar

[7]

Brummayer, R. and Järvisalo, M. Testing and debugging techniques for answer set solver development. Theory and Practice of Logic Programming 10, 4--6 (2010) 741--758.

Digital Library

Google Scholar

[8]

Calimeri, F., Cozza, S., Ianni, G. and Leone, N. Computable functions in ASP: Theory and implementation. In Proc. 24th International Conference on Logic Programming, LNCS 5366. M. Garcia de La Banda and E. Pontelli, Eds. Springer, 2008, 407--424.

Digital Library

Google Scholar

[9]

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

Digital Library

Google Scholar

[10]

Dao-Tran, M., Eiter, T., Fink, M. and Krennwallner, T. Modular nonmonotonic logic programming revisited. In Proc. 25th International Conference on Logic Programming, LNCS 5649. P. M. Hill and D.S. Warren, Eds. Springer, 2009, 145--159.

Digital Library

Google Scholar

[11]

Eiter, T. and Gottlob, G. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15, 3/4 (1995), 289--323.

Crossref

Google Scholar

[12]

Eiter, T., Ianni, G., and Krennwallner, T. Answer set programming: A primer. Reasoning Web, LNCS 5689. S. Tessaris, E. Franconi, T. Eiter, C. Gutierrez, S. Handschuh, M.-C. Rousset, and R. A. Schmidt, Eds. Springer, 2009, 40--110.

Digital Library

Google Scholar

[13]

Eiter, T., Ianni, G., Schindlauer, R. and Tompits, H. A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In Proc. 19th International Joint Conference on Artificial Intelligence. L. P. Kaelbling and A. Saffiotti, Eds. 2005, 90--96.

Digital Library

Google Scholar

[14]

Eiter, T. and Simkus, M. FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols. ACM Trans. Computational Logic 11, 2 (2010).

Digital Library

Google Scholar

[15]

Erdem, E. Applications of answer set programming in phylogenetic systematics. Logic Programming, Knowledge Representation, and Nonmonotonic-Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, LNCS 6565. M. Balduccini and T. C. Son, Eds. Springer, 2011, 415--431.

Digital Library

Google Scholar

[16]

Faber, W., Pfeifer, G., Leone, N., Dell'Armi, T. and Ielpa, G. Design and implementation of aggregate functions in the DLV system. Theory and Practice of Logic Programming 8, 5--6 (2008), 545--580.

Digital Library

Google Scholar

[17]

Ferraris, P., Lee, J. and Lifschitz, V. Stable models and circumscription. Artificial Intelligence 175, 1 (2011), 236--263.

Digital Library

Google Scholar

[18]

Friedrich, G., Fugini, M., Mussi, E., Pernici, B. and Tagni, G. Exception handling for repair in service-based processes. IEEE Trans. on Software Engineering 36, 2 (2010) 198--215.

Digital Library

Google Scholar

[19]

Gebser, M., Guziolowski, C., Ivanchev, M., Schaub, T., Siegel, A., Thiele, S. and Veber, P. Repair and prediction (under inconsistency) in large biological networks with answer set programming. In Proc. 12th International Conference on Principles of Knowledge Representation and Reasoning. F. Lin, U. Sattler, and M. Truszczynski, Eds., 2010, 497--507.

Google Scholar

[20]

Gelfond, M. and Lifschitz, V. The stable model semantics for logic programming. Logic Programming: The 5th International Conference and Symposium. R.A. Kowalski and K. Bowen, Eds. MIT Press, Cambridge, MA, 1988, 1070--1080,

Google Scholar

[21]

Gelfond M. and Lifschitz, V. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 (1991), 365--385.

Digital Library

Google Scholar

[22]

Greco, S., Molinaro, C., Trubitsyna, I. and Zumpano, E. NP datalog: A logic language for expressing search and optimization problems. Theory and Practice of Logic Programming 10, 2 (2010), 125--166.

Crossref

Google Scholar

[23]

Janhunen, T., Oikarinen, E., Tompits, H. and Woltran, S. Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research 35 (2009), 813--857.

Digital Library

Google Scholar

[24]

Kautz, H.A. and Selman, B. Planning as satisfiability. In Proc. 10th European Conference on Artificial Intelligence. B. Neumann, Ed. 1992, 359--363.

Digital Library

Google Scholar

[25]

Leone, N., Rullo, P. and Scarcello, F. Disjunctive stable models: Unfounded sets, fixpoint semantics and computation. Information and Computation 135, 2 (June 1997), 69--112.

Digital Library

Google Scholar

[26]

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

Digital Library

Google Scholar

[27]

Lifschitz, V., Pearce, D. and Valverde, A. Strongly equivalent logic programs. ACM Trans. Computational Logic 2, 4 (2001), 526--541.

Digital Library

Google Scholar

[28]

Lin, F. and Zhao, Y. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc'18th National Conference on Artificial Intelligence and 14th Conference on Innovative Applications of Artificial Intelligence, 2002, 112--117.

Digital Library

Google Scholar

[29]

Marek, V.W. and Truszczyński, M. Autoepistemic logic. J. ACM 38, 3 (1991) 588--619.

Digital Library

Google Scholar

[30]

Marek, V.W. and Truszczyński, M. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm---A 25-Year Perspective. K. Apt, K.V. V.W. Marek, M.W. Truszczyński and D.S. Warren, Eds. Springer, 1999, 375--398.

Google Scholar

[31]

Marek, V.W. and Truszczyński, M. Nonmonotonic Logics - Context-Dependent Reasoning. Springer, 1993.

Digital Library

Google Scholar

[32]

Niemelä, I. Logic programming with stable model semantics as constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3--4 (1999), 241--273.

Digital Library

Google Scholar

[33]

Niemelä, I. Stable models and difference logic. Annals of Mathematics and Artificial Intelligence 53, 1 (2008), 313--329.

Digital Library

Google Scholar

[34]

Nogueira, M., Balduccini, M., Gelfond, M., Watson, R. and Barry, M. A Prolog decision support system for the space shuttle. In Proc. 1st International Workshop on Answer Set Programming. A. Provetti and T. C. Son, Eds, 2001.

Crossref

Google Scholar

[35]

Pearce, D. Equilibrium logic. Annals of Mathematics and Artificial Intelligence 47, 1--2 (2006), 3--41.

Digital Library

Google Scholar

[36]

Pearce, D. and Valverde, A. Towards a first order equilibrium logic for nonmonotonic reasoning. In Proc. 9th European Conference on Logics in Artificial Intelligence, LNCS 3229. Springer, 2004, 147--160.

Crossref

Google Scholar

[37]

Polleres, A. From SPARQL to rules (and back). In Proc. 16th International Conference on World Wide Web. C.L. Williamson, M.E. Zurko, P.F. Patel-Schneider, and P.J. Shenoy, Eds. ACM, 2007, 787--796.

Digital Library

Google Scholar

[38]

Ricca, F., Grasso, G., Alviano, M., Manna, M. Lio, V. Liritano, S. and Leone, N. Team-building with answer set programming in the Gioia-Tauro seaport. Theory and Practice of Logic Programming, 2011;

Digital Library

Google Scholar

[39]

Soininen, T. and Niemelä, I. Developing a declarative rule language for applications in product configuration. In Proc. 1st International Workshop on Practical Aspects of Declarative Languages, LNCS 1551. G. Gupta, Ed. Springer, 1999, 305--319.

Digital Library

Google Scholar

[40]

Woltran, S. A common view on strong, uniform, and other notions of equivalence in answer-set programming. Theory and Practice of Logic Programming 8, 2 (2008), 217--234.

Digital Library

Google Scholar

Cited By

View all

Bringsjord SGiancola MGovindarajulu NSlowik JOswald JBello PClark M(2024)Argument-based inductive logics, with coverage of compromised perceptionFrontiers in Artificial Intelligence10.3389/frai.2023.11445696Online publication date: 8-Jan-2024
https://doi.org/10.3389/frai.2023.1144569
Dodaro C(2024)Design and implementation of modern CDCL ASP solversIntelligenza Artificiale10.3233/IA-24001918:2(239-259)Online publication date: 9-Oct-2024
https://doi.org/10.3233/IA-240019
Lierler YLing GOlson C(2024)Information extraction tool text2almAI Communications10.3233/AIC-22019437:1(53-81)Online publication date: 21-Mar-2024
https://dl.acm.org/doi/10.3233/AIC-220194
Show More Cited By

Index Terms

Answer set programming at a glance
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
  2. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Theorem proving algorithms
2. Theory of computation
  1. Logic
  2. Models of computation
    1. Computability

Recommendations

Answer set programming: a declarative approach to solving search problems
JELIA'06: Proceedings of the 10th European conference on Logics in Artificial Intelligence

The term answer set programming (ASP) was coined by Vladimir Lifschitz to name a new declarative programming paradigm that has its roots in stable model (answer set) semantics of logic programs [16] and implementations of this semantics developed in the ...
Relating constraint answer set programming languages and algorithms

Recently a logic programming language AC was proposed by Mellarkod et al. 1] to integrate answer set programming and constraint logic programming. Soon after that, a clingcon language integrating answer set programming and finite domain constraints, as ...
Answer Sets and the Language of Answer Set Programming

Answer set programming is a declarative programming paradigm based on the answer set semantics of logic programs. This introductory article provides the mathematical background for the discussion of answer set programming in other contributions to this ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 54, Issue 12

December 2011

121 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/2043174

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2011

Published in CACM Volume 54, Issue 12

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

651
Total Citations
View Citations
5,457
Total Downloads

Downloads (Last 12 months)780
Downloads (Last 6 weeks)161

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bringsjord SGiancola MGovindarajulu NSlowik JOswald JBello PClark M(2024)Argument-based inductive logics, with coverage of compromised perceptionFrontiers in Artificial Intelligence10.3389/frai.2023.11445696Online publication date: 8-Jan-2024
https://doi.org/10.3389/frai.2023.1144569
Dodaro C(2024)Design and implementation of modern CDCL ASP solversIntelligenza Artificiale10.3233/IA-24001918:2(239-259)Online publication date: 9-Oct-2024
https://doi.org/10.3233/IA-240019
Lierler YLing GOlson C(2024)Information extraction tool text2almAI Communications10.3233/AIC-22019437:1(53-81)Online publication date: 21-Mar-2024
https://dl.acm.org/doi/10.3233/AIC-220194
Haverinen HJanhunen TPäivärinta TLempinen SKaartinen SMerilä S(2024)Automating Cybersecurity Compliance in DevSecOps with Open Information Model for Security as CodeProceedings of the 4th Eclipse Security, AI, Architecture and Modelling Conference on Data Space10.1145/3685651.3686700(93-102)Online publication date: 22-Oct-2024
https://dl.acm.org/doi/10.1145/3685651.3686700
Shen YZhao X(2024)Computationally Hard Problems for Logic Programs under Answer Set SemanticsACM Transactions on Computational Logic10.1145/367696425:4(1-26)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3676964
Prikler LWotawa FSaadatmand MLonetti FBudnik CLi JGuerriero A(2024)9 in 10 cameras agree: Pedestrians in front possibly endangeredProceedings of the 5th ACM/IEEE International Conference on Automation of Software Test (AST 2024)10.1145/3644032.3644468(219-223)Online publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1145/3644032.3644468
Ishay AYang ZLee JKang ILim D(2024)Think before You Simulate: Symbolic Reasoning to Orchestrate Neural Computation for Counterfactual Question Answering2024 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)10.1109/WACV57701.2024.00656(6684-6693)Online publication date: 3-Jan-2024
https://doi.org/10.1109/WACV57701.2024.00656
Nadeem MDrechsler R(2024)Polynomial Formal Verification of Multi-Valued Logic Circuits within Constant Cutwidth Architectures2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL)10.1109/ISMVL60454.2024.00037(149-154)Online publication date: 28-May-2024
https://doi.org/10.1109/ISMVL60454.2024.00037
Zhou ZSong JYao KShu ZMa L(2024)ISR-LLM: Iterative Self-Refined Large Language Model for Long-Horizon Sequential Task Planning2024 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA57147.2024.10610065(2081-2088)Online publication date: 13-May-2024
https://doi.org/10.1109/ICRA57147.2024.10610065
Nadeem MJha CDrechsler R(2024)Polynomial Formal Verification of Approximate Adders with Constant Cutwidth2024 IEEE European Test Symposium (ETS)10.1109/ETS61313.2024.10567242(1-6)Online publication date: 20-May-2024
https://doi.org/10.1109/ETS61313.2024.10567242
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Answer set programming: a declarative approach to solving search problems

Relating constraint answer set programming languages and algorithms

Answer Sets and the Language of Answer Set Programming

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations