Abstraction for non-ground answer set programs

, &
Artificial Intelligence 300 (C):103563 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2021.103563

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Model-based recasting in answer-set programming.Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits & Stefan Woltran - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):75-104.
Grounding and auto-abstraction.Luca Zanetti - 2020 - Synthese 198 (11):10187-10205.
Preferred answer sets for extended logic programs.Gerhard Brewka & Thomas Eiter - 1999 - Artificial Intelligence 109 (1-2):297-356.
Pruning external minimality checking for answer set programs using semantic dependencies.Thomas Eiter & Tobias Kaminski - 2021 - Artificial Intelligence 290 (C):103402.
Probabilistic Program Abstractions.Holtzen Steven John - unknown
Towards a theory of ground-theoretic content.Stephan Krämer - 2016 - Synthese:1-30.
Towards a theory of ground-theoretic content.Stephan Krämer - 2018 - Synthese 195 (2):785-814.
What is Abstraction in Photography?Diarmuid Costello - 2018 - British Journal of Aesthetics 58 (4):385-400.
Semi-equilibrium models for paracoherent answer set programs.Giovanni Amendola, Thomas Eiter, Michael Fink, Nicola Leone & João Moura - 2016 - Artificial Intelligence 234 (C):219-271.
Abstraction Reconceived.J. P. Studd - 2016 - British Journal for the Philosophy of Science 67 (2):579-615.
The limits of abstraction.Kit Fine - 2002 - New York: Oxford University Press. Edited by Matthias Schirn.
FLP answer set semantics without circular justifications for general logic programs.Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner & Jun Deng - 2014 - Artificial Intelligence 213 (C):1-41.
Computing definite logic programs by partial instantiation.Vadim Kagan, Anil Nerode & V. S. Subrahmanian - 1994 - Annals of Pure and Applied Logic 67 (1-3):161-182.
Answer Sets and Qualitative Decision Making.Gerhard Brewka - 2005 - Synthese 146 (1-2):171-187.
Abstraction Relations Need Not Be Reflexive.Jonathan Payne - 2013 - Thought: A Journal of Philosophy 2 (2):137-147.

Analytics

Added to PP
2022-11-21

Downloads
10 (#1,155,084)

6 months
8 (#341,144)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.
Automatically generating abstractions for planning.Craig A. Knoblock - 1994 - Artificial Intelligence 68 (2):243-302.
A theory of abstraction.Fausto Giunchiglia & Toby Walsh - 1992 - Artificial Intelligence 57 (2-3):323-389.

View all 15 references / Add more references