Switch to: References

Add citations

You must login to add citations.
  1. Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving.Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes P. Wallner & Stefan Woltran - 2022 - Artificial Intelligence 307 (C):103697.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On abstract modular inference systems and solvers.Yuliya Lierler & Miroslaw Truszczynski - 2016 - Artificial Intelligence 236 (C):65-89.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Configurable SAT Solver Challenge.Frank Hutter, Marius Lindauer, Adrian Balint, Sam Bayless, Holger Hoos & Kevin Leyton-Brown - 2017 - Artificial Intelligence 243 (C):1-25.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Vicious circle principle, aggregates, and formation of sets in ASP based languages.Michael Gelfond & Yuanlin Zhang - 2019 - Artificial Intelligence 275 (C):28-77.
    Download  
     
    Export citation  
     
    Bookmark  
  • Backdoors to tractable answer set programming.Johannes Klaus Fichte & Stefan Szeider - 2015 - Artificial Intelligence 220 (C):64-103.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Design and results of the Fifth Answer Set Programming Competition.Francesco Calimeri, Martin Gebser, Marco Maratea & Francesco Ricca - 2016 - Artificial Intelligence 231 (C):151-181.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Gelfond–Zhang aggregates as propositional formulas.Pedro Cabalar, Jorge Fandinno, Torsten Schaub & Sebastian Schellhorn - 2019 - Artificial Intelligence 274 (C):26-43.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Abstract solvers for Dung’s argumentation frameworks.Remi Brochenin, Thomas Linsbichler, Marco Maratea, Johannes P. Wallner & Stefan Woltran - 2018 - Argument and Computation 9 (1):41-72.
    Download  
     
    Export citation  
     
    Bookmark  
  • Overview and analysis of the SAT Challenge 2012 solver competition.Adrian Balint, Anton Belov, Matti Järvisalo & Carsten Sinz - 2015 - Artificial Intelligence 223 (C):120-155.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Fixed point semantics for stream reasoning.Christian Antić - 2020 - Artificial Intelligence 288 (C):103370.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Graph-based construction of minimal models.Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti & Luigi Palopoli - 2022 - Artificial Intelligence 313 (C):103754.
    Download  
     
    Export citation  
     
    Bookmark  
  • Forgetting auxiliary atoms in forks.Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez & Concepción Vidal - 2019 - Artificial Intelligence 275 (C):575-601.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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