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. 1 / 2002  
         
  Article:   DARR – A THEOREM PROVER FOR CONSTRAINED AND RATIONAL DEFAULT LOGICS.

Authors:  MIHAIELA LUPEA.
 
       
         
  Abstract:  Default logics represent an important class of the nonmonotonic formalisms. Using simple by powerful inference rules, called defaults, these logic systems model reasoning patterns of the form ”in the absence of information to the contrary of. . . ”, and thus formalize the default reasoning, a special type of nonmonotonic reasoning. In this paper we propose an automated system, called DARR, with two components: a propositional theorem prover and a theorem prover for constrained and rational propositional default logics. A modified version of semantic tableaux method is used to implement the propositional prover. Also, this theorem proving method is adapted for computing extensions because one of its purpose is to produce models, and extensions are models of the world described by default theories.  
         
     
         
         
      Back to previous page