• Article  

      Learning non-monotonic logic programs: Learning exceptions 

      Dimopoulos, Yannis; Kakas, Antonis C. (1995)
      In this paper we present a framework for learning non-monotonic logic programs. The method is parametric on a classical learning algorithm whose generated rules are to be understood as default rules. This means that these ...
    • 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, ...