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.

该研究论文介绍了一种将一种基于一阶逻辑的扩展语言 FO (.) 转换为 Answer Set Programming (ASP) 的方法， 从而使得基于 ASP 的程序可以作为 FO (.) 的解决器，实验结果表明这种组合可以快速有效地解决 FO (.) 中的问题。

FOLASP: FO (.) 作为答案解决器的输入语言

FOLASP: FO(.) as Input Language for Answer Ser Solvers

Standardization of solver input languages has been a main driver for the
growth of several areas within knowledge representation and reasoning,
fostering the exploitation in actual applications. In this document we present
the ASP-Core-2 standard input language for Answer Set Programming, which has
been adopted in ASP Competition events since 2013.

本文介绍了自 2013 年起在 ASP 比赛中使用的 ASP-Core-2 标准输入语言，它是求解器输入语言标准化推动知识表示和推理等领域应用的主要驱动力之一。

ASP-Core-2 输入语言格式

ASP-Core-2 Input Language Format

Answer Set Programming (ASP) is a well-established paradigm of declarative
programming that has been developed in the field of logic programming and
nonmonotonic reasoning. Advances in ASP solving technology are customarily
assessed in competition events, as it happens for other closely-related
problem-solving technologies like SAT/SMT, QBF, Planning and Scheduling. ASP
Competitions are (usually) biennial events; however, the Fifth ASP Competition
departs from tradition, in order to join the FLoC Olympic Games at the Vienna
Summer of Logic 2014, which is expected to be the largest event in the history
of logic. This edition of the ASP Competition series is jointly organized by
the University of Calabria (Italy), the Aalto University (Finland), and the
University of Genova (Italy), and is affiliated with the 30th International
Conference on Logic Programming (ICLP 2014). It features a completely
re-designed setup, with novelties involving the design of tracks, the scoring
schema, and the adherence to a fixed modeling language in order to push the
adoption of the ASP-Core-2 standard. Benchmark domains are taken from past
editions, and best system packages submitted in 2013 are compared with new
versions and solvers.
To appear in Theory and Practice of Logic Programming (TPLP).

本文介绍了 Answer Set Programming 的发展历程、技术进展及其在解决相关问题中的应用，以比赛形式，特别是 ASP 竞赛，验证了 ASP 的优势和成就。该竞赛的第五届为了加入 FLoC 奥林匹克事件于维也纳逻辑学夏季活动 2014，预计是逻辑史上最大规模的事件。竞赛还推广了 ASP-Core-2 标准。