Skip to main content
×
Home
    • Aa
    • Aa

ASPeRiX, a first-order forward chaining approach for answer set computing*

  • CLAIRE LEFÈVRE (a1), CHRISTOPHER BÉATRIX (a1), IGOR STÉPHAN (a1) and LAURENT GARCIA (a1)
Abstract
Abstract

The natural way to use Answer Set Programming (ASP) to represent knowledge in Artificial Intelligence or to solve a combinatorial problem is to elaborate a first-order logic program with default negation. In a preliminary step, this program with variables is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (stable models) of the program, each answer set encoding one solution of the initial problem. Until today, almost all ASP systems apply this two steps computation. In this article, the project ASPeRiX. is presented as a first-order forward chaining approach for Answer Set Computing. This project was among the first to introduce an approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process. The methodology applies a forward chaining of first-order rules that are grounded on the fly by means of previously produced atoms. Theoretical foundations of the approach are presented, the main algorithms of the ASP solver ASPeRiX. are detailed and some experiments and comparisons with existing systems are provided.

Copyright
Footnotes
Hide All
*

This work was supported by ANR (National Research Agency), project ASPIQ under the reference ANR-12-BS02-0003.

Footnotes
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

M. Alviano , W. Faber and N. Leone 2010. Disjunctive ASP with functions: Decidable queries and effective computation. Theory and Practice of Logic Programming 10 (4–6), 497512.

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

S. Baselice and P. A. Bonatti 2010. A decidable subclass of finitary programs. Theory and Practice of Logic Programming 10 (4–6), 481496.

F. Buccafurri , N. Leone and P. Rullo 2000. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering 12 (5), 845860.

F. Calimeri , G. Ianni and F. Ricca 2014. The third open answer set programming competition. Theory and Practice of Logic Programming 14 (1), 117135.

F. Calimeri , S. Perri and F. Ricca 2008. Experimenting with parallelism for the instantiation of ASP programs. Journal of Algorithms 63 (1–3), 3454.

M. Dao-Tran , T. Eiter , M. Fink , G. Weidinger and A. Weinzierl 2012. OMiGA: An open minded grounding on-the-fly answer set solver. In Proc. of the 13th European Conference on Logics in Artificial Intelligence (JELIA'12), Luis Fariñas del Cerro, Andreas Herzig and Jérôme Mengin, Eds. LNAI, vol. 7519. Springer, 480483.

T. Eiter , J. J. Lu and V. S. Subrahmanian 1997. Computing non-ground representations of stable models. In Proc. of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'97), J. Dix , U. Furbach , and A. Nerode , Eds. LNCS, vol. 1265. Springer, 198217.

W. Faber , N. Leone and G. Pfeifer 1999. Pushing goal derivation in dlp computations. In Proc. of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), M. Gelfond , N. Leone and G. Pfeifer , Eds. LNCS, vol. 1730. Springer, 177191.

M. Gebser , R. Kaminski , A. König and T. Schaub 2011. Advances in gringo Series 3. In Proc. of 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), J. P. Delgrande and W. Faber , Eds. LNCS, vol. 6645. Springer, 345351.

M. Gelfond and V. Lifschitz 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 (3/4), 365386.

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

G. Gottlob , S. Marcus , A. Nerode , G. Salzer and V. S. Subrahmanian 1996. A non-ground realization of the stable and well-founded semantics. Theoretical Computer Science 166 (1–2), 221262.

S. Greco , C. Molinaro and I. Trubitsyna 2013. Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments. Theory and Practice of Logic Programming 13 (4–5), 737752.

K. Konczak , T. Linke and T. Schaub 2006. Graphs and colorings for answer set programming. Theory and Practice of Logic Programming 6, 61106.

C. Lefèvre and P. Nicolas 2009a. A first order forward chaining approach for answer set computing. In Proc. of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), Esra Erdem , Fangzhen Lin and Torsten Schaub , Eds. LNCS, vol. 5753. Springer, 196208.

C. Lefèvre and P. Nicolas 2009b. The first version of a new ASP solver: ASPeRiX . In Proc. of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), Esra Erdem , Fangzhen Lin and Torsten Schaub , Eds. LNCS, vol. 5753. Springer, 522527.

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

F. Lin and Y. Zhao 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157 (1–2), 115137.

L. Liu , E. Pontelli , T. C. Son and M. Truszczynski 2010. Logic programs with abstract constraint atoms: The role of computations. Artificial Intelligence 174 (3–4), 295315.

L. Liu and M. Truszczynski 2005. Pbmodels - software to compute stable models by pseudoboolean solvers. In Proc. of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05), C. Baral , G. Greco , N. Leone , and G. Terracina , Eds. LNCS, vol. 3662. Springer, 410415.

I. Niemelä 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25 (3–4), 241273.

M. Ostrowski and T. Schaub 2012. ASP modulo CSP: The clingcon system. Theory and Practice of Logic Programming 12 (4–5), 485503.

S. Perri , F. Scarcello , G. Catalano and N. Leone 2007. Enhancing dlv instantiator by backjumping techniques. Annals of Mathematics and Artificial Intelligence 51 (2–4), 195228.

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

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Type Description Title
PDF
Supplementary Materials

Lefevre supplementary material
Lefevre supplementary material 1

 PDF (194 KB)
194 KB

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 26 *
Loading metrics...

Abstract views

Total abstract views: 184 *
Loading metrics...

* Views captured on Cambridge Core between 16th January 2017 - 23rd August 2017. This data will be updated every 24 hours.