论文标题
用于验证答案集程序的工具和方法
Tools and Methodologies for Verifying Answer Set Programs
论文作者
论文摘要
答案集编程（ASP）是一种强大的声明性编程范式，通常用于解决挑战性搜索和优化问题。 ASP的建模语言由复杂的求解算法（求解器）支持，这些算法（求解器）使解决方案搜索有效，同时使程序员能够以高水平的抽象来对问题进行建模。作为知识表示和推理的一种方法，ASP从其简单性，简洁性和严格定义的语义中受益。这些特征使ASP成为开发正式可验证程序的直接方法。在人工智能（AI）的背景下，ASP程序的清晰度可用于构建可解释的，可信赖的AI。为了支持这些目标，我的研究涉及扩展支持ASP Progam验证的理论和工具。
Answer Set Programming (ASP) is a powerful declarative programming paradigm commonly used for solving challenging search and optimization problems. The modeling languages of ASP are supported by sophisticated solving algorithms (solvers) that make the solution search efficient while enabling the programmer to model the problem at a high level of abstraction. As an approach to Knowledge Representation and Reasoning, ASP benefits from its simplicity, conciseness and rigorously defined semantics. These characteristics make ASP a straightforward way to develop formally verifiable programs. In the context of artificial intelligence (AI), the clarity of ASP programs lends itself to the construction of explainable, trustworthy AI. In support of these goals, my research is concerned with extending the theory and tools supporting the verification of ASP progams.
