Author:
HARRISON AMELIA,LIFSCHITZ VLADIMIR,RAJU DHANANJAY
Abstract
AbstractWe argue that turning a logic program into a set of completed definitions can be sometimes thought of as the “reverse engineering” process of generating a set of conditions that could serve as a specification for it. Accordingly, it may be useful to define completion for a large class of Answer Set Programming (ASP) programs and to automate the process of generating and simplifying completion formulas. Examining the output produced by this kind of software may help programmers to see more clearly what their program does, and to what degree its behavior conforms with their expectations. As a step toward this goal, we propose here a definition of program completion for a large class of programs in the input language of the ASP grounder gringo, and study its properties.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference12 articles.
1. Stable models and circumscription
2. Tight logic programs
3. Fixed-point extensions of first-order logic
4. Harrison A. , Lifschitz V. and Yang F. 2014. The semantics of Gringo and infinitary propositional formulas. In Proc. of International Conference on Principles of Knowledge Representation and Reasoning (KR), 32–41.
5. Connecting First-Order ASP and the Logic FO(ID) through Reducts
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献