FLP answer set semantics without circular justifications for general logic programs

, , , , , &
Artificial Intelligence 213 (C):1-41 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2014.05.001

Links

PhilArchive



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

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

Domain expansion for ASP-programs with external sources.Thomas Eiter, Michael Fink, Thomas Krennwallner & Christoph Redl - 2016 - Artificial Intelligence 233 (C):84-121.
Determining inference semantics for disjunctive logic programs.Yi-Dong Shen & Thomas Eiter - 2019 - Artificial Intelligence 277 (C):103165.
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.
Hybrid Probabilistic Logic Programs as Residuated Logic Programs.Carlos Damásio & Luís Pereira - 2002 - Studia Logica 72 (1):113-138.
Hybrid probabilistic logic programs as residuated logic programs.Carlos Viegas Damásio & Luís Moniz Pereira - 2002 - Studia Logica 72 (1):113 - 138.
Answer Sets and Qualitative Decision Making.Gerhard Brewka - 2005 - Synthese 146 (1-2):171-187.
Safe beliefs for propositional theories.Mauricio Osorio, Juan Pérez & José Arrazola - 2005 - Annals of Pure and Applied Logic 134 (1):63-82.
Safe beliefs for propositional theories.Mauricio Osorio, Juan Antonio Navarro Pérez & José Arrazola - 2005 - Annals of Pure and Applied Logic 134 (1):63-82.
The Refined Extension Principle for Semantics of Dynamic Logic Programming.José Júlio Alferes, Federico Banti, Antonio Brogi & João Alexandre Leite - 2005 - Studia Logica 79 (1):7-32.
A game semantics for disjunctive logic programming.Thanos Tsouanas - 2013 - Annals of Pure and Applied Logic 164 (11):1144-1175.
The Refined Extension Principle for Semantics of Dynamic Logic Programming.Joao Alexandre Leite - 2005 - Studia Logica 79 (1):7-32.
A general theory of confluent rewriting systems for logic programming and its applications.Jürgen Dix, Mauricio Osorio & Claudia Zepeda - 2001 - Annals of Pure and Applied Logic 108 (1-3):153-188.
Preferred answer sets for extended logic programs.Gerhard Brewka & Thomas Eiter - 1999 - Artificial Intelligence 109 (1-2):297-356.
Stratified, Weak Stratified, and Three-valued Semantics.Melvin Fitting & Marion Ben-Jacob - unknown
On deductive bases for paraconsistent answer set semantics.N. V. Mayatskiy & S. P. Odintsov - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):131-146.

Analytics

Added to PP
2020-12-22

Downloads
12 (#1,058,801)

6 months
9 (#290,637)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Fixed point semantics for stream reasoning.Christian Antić - 2020 - Artificial Intelligence 288 (C):103370.
A progression semantics for first-order logic programs.Yi Zhou & Yan Zhang - 2017 - Artificial Intelligence 250 (C):58-79.

Add more citations

References found in this work

Computing ideal sceptical argumentation.P. M. Dung, P. Mancarella & F. Toni - 2007 - Artificial Intelligence 171 (10-15):642-674.
Answer set programming and plan generation.Vladimir Lifschitz - 2002 - Artificial Intelligence 138 (1-2):39-54.

View all 9 references / Add more references