Stable models for infinitary formulas with extensional atoms-Reference-Cited by-同舟云学术

Stable models for infinitary formulas with extensional atoms

Published:2016-09 Issue:5-6 Volume:16 Page:771-786
ISSN:1471-0684
Container-title:Theory and Practice of Logic Programming
language:en
Short-container-title:Theory and Practice of Logic Programming

Author:

HARRISON AMELIA,LIFSCHITZ VLADIMIR

Abstract

AbstractThe definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used to reason about infinitary definitions.

Publisher

Cambridge University Press (CUP)

Subject

Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software

Reference13 articles.

1. Transition systems for model generators — a unifying approach;Lierler;Theory and Practice of Logic Programming, 27th International Conference on Logic Programming (ICLP) Special Issue,2011

2. Connecting First-Order ASP and the Logic FO(ID) through Reducts

3. Abstract gringo

4. Ferraris P. 2005. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 119–131.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Positive Dependency Graphs Revisited;Theory and Practice of Logic Programming;2022-08-23

2. On the Foundations of Grounding in Answer Set Programming;Theory and Practice of Logic Programming;2022-07-25