We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programming. We elaborate upon the foundations of this idea in the context of the logic of Here-and-There and show how it can be derived from the logical principle of extension by definition. We then provide an austere form of logic programs that may serve as a normalform for logic programs similar to conjunctive normalform in classical logic. Finally, we take the key ideas and propose a modeling methodology for ASP beginners and illustrate how it can be used.
翻译:我们从“答案组合”编程的民间传说中汲取了一种想法,即选择、廉正限制以及限制性规则格式足以为“答案组合”编程提供依据。我们从“这里和那里”的逻辑角度详细阐述了这一想法的基础,并说明了如何从逻辑上的扩展原则中推导出这一想法。然后我们提供了一种快速的逻辑程序形式,它可以作为类似于传统逻辑中结合正常的逻辑程序的一种正常形式。最后,我们采纳了关键的想法,并为ASP初创者提出了一种建模方法,并说明了如何使用它。