FOLASP: FO(.) as Input Language for Answer Ser Solvers
Kylian Van Dessel, Jo Devriendt, and Joost Vennekens

TL;DR
This paper introduces a translation tool that converts FO(.) specifications into ASP-Core-2, enabling the use of existing ASP solvers for FO(.) problems and demonstrating competitive performance with the IDP system.
Contribution
It presents a novel translation approach from FO(.) to ASP-Core-2, expanding the accessibility and applicability of FO(.) in answer set solving.
Findings
The translation enables existing ASP solvers to handle FO(.) specifications effectively.
Experimental results show the translation-based approach is competitive with the IDP system.
The method broadens the practical use of FO(.) in declarative problem solving.
Abstract
Over the past decades, Answer Set Programming (ASP) has emerged as an important paradigm for declarative problem solving. Technological progress in this area has been stimulated by the use of common standards, such as the ASP-Core-2 language. While ASP has its roots in non-monotonic reasoning, efforts have also been made to reconcile ASP with classical first-order logic (FO). This has resulted in the development of FO(.), an expressive extension of FO, which allows ASP-like problem solving in a purely classical setting. This language may be more accessible to domain experts already familiar with FO, and may be easier to combine with other formalisms that are based on classical logic. It is supported by the IDP inference system, which has successfully competed in a number of ASP competitions. Here, however, technological progress has been hampered by the limited number of systems that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Logic, programming, and type systems
