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 / 2005  
         
  Article:   COMPUTING DEFAULT EXTENSIONS. A HEURISTIC APPROACH.

Authors:  MIHAIELA LUPEA.
 
       
         
  Abstract:  Default logics represent a simple but a powerful class of non- monotonic formalisms. The main computational problem specific to these logical systems is a search problem: finding all the extensions (sets of non- monotonic theorems - beliefs) of a default theory. GADEL is an automated system based on a heuristic approach of the classical default extension com- puting problem and applies the principles of genetic algorithms to solve the problem. The purpose of this paper is to extend this heuristic approach for computing all type of default extensions: classical, justified, constrained and rational.  
         
     
         
         
      Back to previous page