FOLASP: FO(·) as Input Language for Answer Set Solvers

DOI10.1017/S1471068421000351MaRDI QIDQ6063868zbMATH OpenOpenAlexFDO

Authors Jo Devriendt, Joost Vennekens

Publication date 12 December 2023

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.04020

zbMATH Keywords

answer-set programmingdeclarative programmingfirst-order logic

Mathematics Subject Classification ID

Logic programming (68N17)

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 are available for FO(.). In this paper, we aim to address this gap by means of a translation tool that transforms an FO(.) specification into ASP-Core-2, thereby allowing ASP-Core-2 solvers to be used as solvers for FO(.) as well. We present experimental results to show that the resulting combination of our translation with an off-the-shelf ASP solver is competitive with the IDP system as a way of solving problems formulated in FO(.). Under consideration for acceptance in TPLP.

Recommendations

• Reducing fuzzy answer set programming to model finding in fuzzy logics
• ASP-Core-2 input language format
• Connecting first-order ASP and the logic FO(ID) through reducts
• A translational approach to constraint answer set solving
• Answer Set Programming: A Primer

Cites work

• A logic of nonmonotone inductive definitions
• A mathematical introduction to logic.
• A Tarskian informal semantics for answer set programming
• ASP-Core-2 input language format
• Design and results of the Fifth Answer Set Programming Competition
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• Lazy model expansion: interleaving grounding with search
• Logics in Artificial Intelligence
• Multi-shot ASP solving with clingo
• The DLV system for knowledge representation and reasoning
• The Seventh Answer Set Programming Competition: Design and Results
• The well-founded semantics for general logic programs

This page was built for publication: FOLASP: FO(·) as Input Language for Answer Set Solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063868)