Article

The First Version of a New ASP Solver: ASPeRiX

Authors:

Claire Lefèvre,

Pascal NicolasAuthors Info & Claims

LPNMR '09: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning

Pages 522 - 527

https://doi.org/10.1007/978-3-642-04238-6_52

Published: 01 September 2009 Publication History

Abstract

We present the first version of our ASP solver <Literal>ASPeRiX</Literal> that implements a new approach of answer set computation. The main specifity of our system is to realize a forward chaining of first order rules that are grounded on the fly. So, unlike all others available ASP systems <Literal>ASPeRiX</Literal> does not need a pregrounding processing.

References

[1]

Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP: Theory and implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407-424. Springer, Heidelberg (2008).

Crossref

Google Scholar

[2]

Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386-392 (2007).

Crossref

Google Scholar

[3]

Gebser, M., Schaub, T., Thiele, S.: GrinGo: A new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 266-271. Springer, Heidelberg (2007).

Crossref

Google Scholar

[4]

Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K. (eds.) ICLP, pp. 1070-1080. MIT Press, Cambridge (1988).

Google Scholar

[5]

Lefèvre, C., Nicolas, P.: A first order forward chaining approach for answer set computing. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753. Springer, Heidelberg (2009).

Crossref

Google Scholar

[6]

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

Crossref

Google Scholar

[7]

Dal Palù, A., Dovier, A., Pontelli, E., Rossi, G.: Answer set programming with constraints using lazy grounding. In: Hill, P., Warren, D. (eds.) ICLP 2009. LNCS, vol. 5649. Springer, Heidelberg (2009).

Google Scholar

[8]

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

Crossref

Google Scholar

[9]

Syrjänen, T.: Implementation of local grounding for logic programs for stable model semantics. Technical report, Helsinki University of Technology (1998).

Google Scholar

[10]

http://xsb.sourceforge.net

Google Scholar

Cited By

View all

Bogaerts BWeinzierl A(2018)Exploiting justifications for lazy grounding of answer set programsProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3304900(1737-1745)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304889.3304900
Eiter TKaminski TWeinzierl A(2017)Lazy-grounding for answer set programs with external source accessProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171787(1015-1022)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171787
Calimeri FFuscà DPerri SZangari J(2016)-dlv: The New Intelligent Grounder of dlvAI*IA 2016 Advances in Artificial Intelligence10.1007/978-3-319-49130-1_15(192-207)Online publication date: 29-Nov-2016
https://dl.acm.org/doi/10.1007/978-3-319-49130-1_15
Show More Cited By

Recommendations

A New Version of the Rule Induction System LERS

A new version of the rule induction system LERS is described and compared with the old version of LERS. Experiments were done for comparison of performance for both versions of LERS and the two other rule-induction systems: AQ15 and C4.5. The new LERS ...
First-order ASP programs as CHR programs
SAC '21: Proceedings of the 36th Annual ACM Symposium on Applied Computing

We present in this paper a way to use the paradigm of Answer Set Programming (ASP) into the Constraint Handling Rules (CHR) paradigm. We present a translation of the ASP language to the Constraint Handling Rules language.

The committed-choice principle ...
Computable Functions in ASP: Theory and Implementation
ICLP '08: Proceedings of the 24th International Conference on Logic Programming

Disjunctive Logic Programming (DLP) under the answer set semantics, often referred to as Answer Set Programming (ASP), is a powerful formalism for knowledge representation and reasoning (KRR). The latest years witness an increasing effort for embedding ...

Comments

Information & Contributors

Information

Published In

LPNMR '09: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning

September 2009

654 pages

ISBN:9783642042379

Editors:
Esra Erdem
Faculty of Engineering and Natural Sciences, Sabanci University, Orhanli, Tuzla, Istanbul, Turkey 34956
,
Fangzhen Lin
Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay,, Hong Kong
,
Torsten Schaub
Institut für Informatik, Universität Potsdam, Potsdam, Germany D-14482

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 September 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bogaerts BWeinzierl A(2018)Exploiting justifications for lazy grounding of answer set programsProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3304900(1737-1745)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304889.3304900
Eiter TKaminski TWeinzierl A(2017)Lazy-grounding for answer set programs with external source accessProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171787(1015-1022)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171787
Calimeri FFuscà DPerri SZangari J(2016)-dlv: The New Intelligent Grounder of dlvAI*IA 2016 Advances in Artificial Intelligence10.1007/978-3-319-49130-1_15(192-207)Online publication date: 29-Nov-2016
https://dl.acm.org/doi/10.1007/978-3-319-49130-1_15
Alviano MCalimeri FCharwat GDao-Tran MDodaro CIanni GKrennwallner TKronegger MOetsch JPfandler APührer JRedl CRicca FSchneider PSchwengerer MSpendier LWallner JXiao G(2013)The Fourth Answer Set Programming CompetitionProceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning - Volume 814810.1007/978-3-642-40564-8_5(42-53)Online publication date: 15-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-40564-8_5
Dao-Tran MEiter TFink MWeidinger GWeinzierl A(2012)OMiGAProceedings of the 13th European conference on Logics in Artificial Intelligence10.1007/978-3-642-33353-8_38(480-483)Online publication date: 26-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33353-8_38
Calimeri FIanni GRicca FAlviano MBria ACatalano GCozza SFaber WFebbraro OLeone NManna MMartello APanetta CPerri SReale KSantoro MSirianni MTerracina GVeltri P(2011)The third answer set programming competitionProceedings of the 11th international conference on Logic programming and nonmonotonic reasoning10.5555/2010192.2010246(388-403)Online publication date: 16-May-2011
https://dl.acm.org/doi/10.5555/2010192.2010246
Toni FSergot M(2011)Argumentation and answer set programmingLogic programming, knowledge representation, and nonmonotonic reasoning10.5555/2001078.2001089(164-180)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2001078.2001089
Devred CDoutre SLefèvre CNicolas P(2010)Dialectical Proofs for Constrained ArgumentationProceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 201010.5555/1860828.1860845(159-170)Online publication date: 5-Aug-2010
https://dl.acm.org/doi/10.5555/1860828.1860845

View Options

View options

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

Recommendations

A New Version of the Rule Induction System LERS

First-order ASP programs as CHR programs

Computable Functions in ASP: Theory and Implementation

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations