• Article  

      The computational value of joint consistency 

      Dimopoulos, Yannis (1994)
      In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied ...
    • Article  

      Computing argumentation in logic programming 

      Kakas, Antonis C.; Toni, F. (1999)
      In recent years, argumentation has been shown to be an appropriate framework in which logic programming with negation as failure as well as other logics for non-monotonic reasoning can be encompassed. Many of the existing ...
    • Article  

      Default reasoning via negation as failure 

      Kakas, Antonis C. (1994)
      We show how recent developments in the study of negation as failure of Logic Programming can be used to define a general framework for Default Reasoning. Negation as failure can be viewed as a form of hypotheses with which ...
    • Article  

      Knowledge qualification through argumentation 

      Michael, Loizos; Kakas, Antonis C. (2009)
      We propose a framework that brings together two major forms of default reasoning in Artificial Intelligence: default property classification in static domains, and default property persistence in temporal domains. Emphasis ...
    • Article  

      Modular-E and the role of elaboration tolerance in solving the qualification problem 

      Kakas, Antonis C.; Michael, Loizos; Miller, R. (2010)
      We describe Modular-E (ME), a specialized, model-theoretic logic for reasoning about actions. ME is able to represent non-deterministic domains involving concurrency, static laws (constraints), indirect effects (ramifications), ...
    • Article  

      On the computational complexity of assumption-based argumentation for default reasoning 

      Dimopoulos, Yannis; Nebel, B.; Toni, F. (2002)
      Bondarenko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, the framework extends these formalisms ...