The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

    STUDIA INFORMATICA - Issue no. 2 / 2009  

  Abstract:  Drawing conclusions from incomplete information by making default assumptions represents default reasoning. Default logics, a class of nonmonotonic logical systems, formalize this type of reasoning using special inference rules, the defaults. During the inferential process, a default theory is extended with plausible conclusions (beliefs) obtaining default extensions. The very high theoretical complexity of the extension computation problem suggests the use of non-deterministic techniques for an efficient computation. In this paper we propose a uniform theoretical approach of the extension computation problem for all default logics (classical, justified, constrained, rational) applying Ant Colony Optimization metaheuristic.

Key words and phrases. default logics, nonmonotonic reasoning, ant colony optimization.
      Back to previous page