• Article  

      ACLP: Flexible solutions to complex problems 

      Kakas, Antonis C.; Mourlas, G. (1997)
      In this paper we present a new system for non-monotonic reasoning performed using abduction. The system, called ACLP, is a programming language based on the framework of Abductive and Constraint Logic Programming (ACLP) ...
    • Conference Object  

      Argumentation for propositional logic and nonmonotonic reasoning 

      Kakas, Antonis C.; Toni, F.; Mancarella, P. (CEUR-WS, 2014)
      Argumentation has played a significant role in understanding and unifying under a common framework different forms of defeasible reasoning in AI. Argumentation is also close to the original inception of logic as a framework ...
    • Article  

      Classical methods in nonmonotonic reasoning 

      Dimopoulos, Yannis (1994)
      In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...
    • Article  

      Computing the acceptability semantics 

      Toni, F.; Kakas, Antonis C. (1995)
      We present a proof theory and a proof procedure for nonmonotonic reasoning based on the acceptability semantics for logic programming, formulated in an argumentation framework. These proof theory and procedure are defined ...
    • 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 ...
    • Conference Object  

      Preferred arguments are harder to compute than stable extensions 

      Dimopoulos, Yannis; Nebel, B.; Toni, F. (1999)
      Based on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, ...