Switch to: References

Add citations

You must login to add citations.
  1. How to construct Remainder Sets for Paraconsistent Revisions: Preliminary Report.Rafael Testa, Eduardo Fermé, Marco Garapa & Maurício Reis - 2018 - 17th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING.
    Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Determining inference semantics for disjunctive logic programs.Yi-Dong Shen & Thomas Eiter - 2019 - Artificial Intelligence 277 (C):103165.
    Download  
     
    Export citation  
     
    Bookmark  
  • Evaluating epistemic negation in answer set programming.Yi-Dong Shen & Thomas Eiter - 2016 - Artificial Intelligence 237 (C):115-135.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming.Jesse Heyninck, Ofer Arieli & Bart Bogaerts - 2024 - Artificial Intelligence 331 (C):104110.
    Download  
     
    Export citation  
     
    Bookmark  
  • On the limits of forgetting in Answer Set Programming.Ricardo Gonçalves, Matthias Knorr, João Leite & Stefan Woltran - 2020 - Artificial Intelligence 286 (C):103307.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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.
    As is well known, answer-set programs do not satisfy the replacement property in general, i.e., programs and that are equivalent may cease to be so when they are put in the context of some other program, i.e., and may have different answer sets. Lifschitz, Pearce, and Valverde thus introduced strong equivalence for context-independent equivalence, and proved that such equivalence holds between given programs and iff and are equivalent theories in the monotonic logic of here-and-there. In this article, we consider a (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation