research-article

A framework for easing the development of applications embedding answer set programming

Authors:

Stefano Germano,

Jessica Zangari,

Marco Anastasio,

Francesco Calimeri,

Simona PerriAuthors Info & Claims

PPDP '16: Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming

Pages 38 - 49

https://doi.org/10.1145/2967973.2968594

Published: 05 September 2016 Publication History

Abstract

Answer Set Programming (ASP) is a well-established declarative problem solving paradigm which became widely used in AI and recognized as a powerful tool for knowledge representation and reasoning (KRR), especially for its high expressiveness and the ability to deal also with incomplete knowledge.

Recently, thanks to the availability of a number of robust and efficient implementations, ASP has been increasingly employed in a number of different domains, and used for the development of industrial-level and enterprise applications. This made clear the need for proper development tools and interoperability mechanisms for easing interaction and integration with external systems in the widest range of real-world scenarios, including mobile applications and educational contexts.

In this work we present a framework for integrating the KRR capabilities of ASP into generic applications. We show the use of the framework by illustrating proper specializations for some relevant ASP systems over different platforms, including the mobile setting; furthermore, the potential of the framework for educational purposes is illustrated by means of the development of several ASP-based applications.

References

[1]

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

Digital Library

[2]

G. Brewka, T. Eiter, and M. Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92--103, 2011.

Digital Library

[3]

F. Buccafurri, N. Leone, and P. Rullo. Strong and Weak Constraints in Disjunctive Datalog. In J. Dix, U. Furbach, and A. Nerode, editors, Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97), volume 1265 of Lecture Notes in AI (LNAI), pages 2--17, Dagstuhl, Germany, July 1997. Springer Verlag.

Digital Library

[4]

F. Calimeri, W. Faber, M. Gebser, G. Ianni, R. Kaminski, T. Krennwallner, N. Leone, F. Ricca, and T. Schaub. Asp-core-2: Input language format, 2012.

[5]

F. Calimeri, D. Fuscà, S. Germano, S. Perri, and J. Zangari. Embedding ASP in mobile systems: discussion and preliminary implementations. In Proceedings of the Eighth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2015), workshop of the 31st International Conference on Logic Programming (ICLP 2015), August 2015.

[6]

F. Calimeri, D. Fuscà, S. Germano, S. Perri, and J. Zangari. embASP, since 2015. https://www.mat.unical.it/calimeri/projects/embasp/.

[7]

F. Calimeri, M. Gebser, M. Maratea, and F. Ricca. Design and results of the fifth answer set programming competition. Artificial Intelligence, 231:151--181, 2016.

Digital Library

[8]

F. Calimeri and F. Ricca. On the application of the answer set programming system dlv in industry: a report from the field. Book Reviews, 2013(03), 2013.

[9]

T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Declarative problem-solving using the dlv system. In Logic-based artificial intelligence, pages 79--103. Springer, 2000.

Digital Library

[10]

T. Eiter, G. Ianni, and T. Krennwallner. Answer Set Programming: A Primer. In Reasoning Web. Semantic Technologies for Information Systems, 5th International Summer School - Tutorial Lectures, pages 40--110, Brixen-Bressanone, Italy, August-September 2009.

Digital Library

[11]

W. Faber, N. Leone, and G. Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In J. J. Alferes and J. Leite, editors, Proceedings of the 9th European Conference on Artificial Intelligence (JELIA 2004), volume 3229 of Lecture Notes in AI (LNAI), pages 200--212. Springer Verlag, Sept. 2004.

[12]

O. Febbraro, G. Grasso, N. Leone, and F. Ricca. JASP: a framework for integrating Answer Set Programming with Java. In Proc. of KR2012. AAAI Press, 2012.

[13]

E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design patterns: elements of, 1994.

[14]

M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and M. Schneider. Potassco: The Potsdam answer set solving collection. AI Communications, 24(2):107--124, 2011.

[15]

M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. Clingo = ASP + control: Preliminary report. In M. Leuschel and T. Schrijvers, editors, Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP'14), volume arXiv:1405.3694v1, 2014. Theory and Practice of Logic Programming, Online Supplement.

[16]

M. Gebser, M. Maratea, and F. Ricca. What's hot in the answer set programming competition. In D. Schuurmans and M. P. Wellman, editors, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA., pages 4327--4329. AAAI Press, 2016.

Digital Library

[17]

M. Gelfond and N. Leone. Logic Programming and Knowledge Representation -- the A-Prolog perspective. Artificial Intelligence, 138(1-2):3--38, 2002.

Digital Library

[18]

M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365--385, 1991.

Digital Library

[19]

Google Activity Recognition API. https://developer.android.com/reference/com/google/android/gms/location/ActivityRecognition.html.

[20]

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):499--562, July 2006.

Digital Library

[21]

N. Leone and F. Ricca. Answer set programming: A tour from the basics to advanced development tools and industrial applications. In RR2015, to appear, LNCS, 2015.

[22]

V. Lifschitz. Answer Set Planning. In D. D. Schreye, editor, Proceedings of the 16th International Conference on Logic Programming (ICLP'99), pages 23--37, Las Cruces, New Mexico, USA, Nov. 1999. The MIT Press.

Digital Library

[23]

V. W. Marek and M. Truszczyński. Stable Models and an Alternative Logic Programming Paradigm. In K. R. Apt, V. W. Marek, M. Truszczyński, and D. S. Warren, editors, The Logic Programming Paradigm--A 25-Year Perspective, pages 375--398. Springer Verlag, 1999.

[24]

I. Niemelä. Logic Programming with Stable Model Semantics as Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-4):241--273, 1999.

Digital Library

[25]

Potassco, the Potsdam Answer Set Solving Collection. http://potassco.sourceforge.net/.

[26]

T. C. Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing, 9:401--424, 1991.

Digital Library

[27]

S. P. Radziszowski. Small Ramsey Numbers. The Electronic Journal of Combinatorics, 1, 1994. Revision 9: July 15, 2002.

[28]

F. Ricca. The DLV Java Wrapper. In M. de Vos and A. Provetti, editors, Proceedings ASP03 - Answer Set Programming: Advances in Theory and Implementation, pages 305--316, Messina, Italy, Sept. 2003. Online at http://CEUR-WS.org/Vol-78/.

[29]

M. Thimm. Tweety: A comprehensive collection of java libraries for logical aspects of artificial intelligence and knowledge representation. In KR, 2014.

[30]

J. B. Warmer and A. G. Kleppe. The Object Constraint Language: Precise Modeling With Uml (Addison-Wesley Object Technology Series). Addison-Wesley Professional, Oct. 1998.

Digital Library

Cited By

Calimeri FIanni GPacenza FPerri SZangari J(2024)Forget and Regeneration Techniques for Optimizing ASP-Based Stream ReasoningPractical Aspects of Declarative Languages10.1007/978-3-031-52038-9_1(1-17)Online publication date: 10-Jan-2024
https://doi.org/10.1007/978-3-031-52038-9_1
KAMINSKI RROMERO JSCHAUB TWANKO P(2021)How to Build Your Own ASP-based System?!Theory and Practice of Logic Programming10.1017/S147106842100050823:1(299-361)Online publication date: 13-Dec-2021
https://doi.org/10.1017/S1471068421000508
Eiter TKaminski T(2020)Pruning external minimality checking for answer set programs using semantic dependenciesArtificial Intelligence10.1016/j.artint.2020.103402(103402)Online publication date: Oct-2020
https://doi.org/10.1016/j.artint.2020.103402
Show More Cited By

Index Terms

A framework for easing the development of applications embedding answer set programming

Recommendations

Boosting the Development of ASP-Based Applications in Mobile and General Scenarios
AI*IA 2016 Advances in Artificial Intelligence
Abstract
Answer Set Programming (ASP) is a well-established declarative programming paradigm in close relationship with other formalisms such as Satisfiability Modulo Theories, Constraint Handling Rules, FO(.) (First-Order logic extensions), Planning ...
-dlv: The New Intelligent Grounder of dlv
AI*IA 2016 Advances in Artificial Intelligence
Abstract
DLV is a powerful system for knowledge representation and reasoning which supports Answer Set Programming (ASP) – a logic-based programming paradigm for solving problems in a fully declarative way. DLV is widely used in academy, and, importantly, ...
Computing preferred answer sets by meta-interpretation in Answer Set Programming

Most recently, Answer Set Programming (ASP) has been attracting interest as a new paradigm for problem solving. An important aspect, for which several approaches have been presented, is the handling of preferences between rules. In this paper, we ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

PPDP '16: Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming

September 2016

249 pages

ISBN:9781450341486

DOI:10.1145/2967973

Conference Chair:
James Cheney
University of Edinburgh, UK
,
Program Chair:
Germán Vidal
Universitat Politècnica de València, Spain

Copyright © 2016 ACM.

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]

In-Cooperation

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 September 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

EU

Conference

PPDP '16

PPDP '16: 18th International Symposium on Principles and Practice of Declarative Programming

September 5 - 7, 2016

Edinburgh, United Kingdom

Acceptance Rates

PPDP '16 Paper Acceptance Rate 17 of 37 submissions, 46%;

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
96
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Calimeri FIanni GPacenza FPerri SZangari J(2024)Forget and Regeneration Techniques for Optimizing ASP-Based Stream ReasoningPractical Aspects of Declarative Languages10.1007/978-3-031-52038-9_1(1-17)Online publication date: 10-Jan-2024
https://doi.org/10.1007/978-3-031-52038-9_1
KAMINSKI RROMERO JSCHAUB TWANKO P(2021)How to Build Your Own ASP-based System?!Theory and Practice of Logic Programming10.1017/S147106842100050823:1(299-361)Online publication date: 13-Dec-2021
https://doi.org/10.1017/S1471068421000508
Eiter TKaminski T(2020)Pruning external minimality checking for answer set programs using semantic dependenciesArtificial Intelligence10.1016/j.artint.2020.103402(103402)Online publication date: Oct-2020
https://doi.org/10.1016/j.artint.2020.103402
Calimeri FFuscà DGermano SPerri SZangari J(2019)Fostering the Use of Declarative Formalisms for Real-World Applications: The EmbASP FrameworkNew Generation Computing10.1007/s00354-018-0046-237:1(29-65)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00354-018-0046-2
Bobek SNalepa GŚlażyński M(2018)HEARTDROID—Rule engine for mobile and context‐aware expert systemsExpert Systems10.1111/exsy.1232836:1Online publication date: 23-Aug-2018
https://doi.org/10.1111/exsy.12328
GEBSER MKAMINSKI RKAUFMANN BSCHAUB T(2018)Multi-shot ASP solving with clingoTheory and Practice of Logic Programming10.1017/S1471068418000054(1-56)Online publication date: 10-Jul-2018
https://doi.org/10.1017/S1471068418000054
Calimeri FGermano SPalermiti EReale KRicca F(2018)Developing ASP Programs with ASPIDE and LoIDEKI - Künstliche Intelligenz10.1007/s13218-018-0534-z32:2-3(185-186)Online publication date: 16-May-2018
https://doi.org/10.1007/s13218-018-0534-z
Adrian WAlviano MCalimeri FCuteri BDodaro CFaber WFuscà DLeone NManna MPerri SRicca FVeltri PZangari J(2018)The ASP System DLV: Advancements and ApplicationsKI - Künstliche Intelligenz10.1007/s13218-018-0533-032:2-3(177-179)Online publication date: 14-May-2018
https://doi.org/10.1007/s13218-018-0533-0
Calimeri FGermano SIanni GPacenza FPerri SZangari J(2018)Integrating Rule-Based AI Tools into Mainstream Game DevelopmentRules and Reasoning10.1007/978-3-319-99906-7_23(310-317)Online publication date: 24-Aug-2018
https://doi.org/10.1007/978-3-319-99906-7_23
Calimeri FGermano SIanni GPacenza FPezzimenti ATucci A(2018)Answer Set Programming for Declarative Content Specification: A Scalable Partitioning-Based ApproachAI*IA 2018 – Advances in Artificial Intelligence10.1007/978-3-030-03840-3_17(225-237)Online publication date: 9-Nov-2018
https://doi.org/10.1007/978-3-030-03840-3_17
Show More Cited By

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten