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 / 1999  
         
  Article:   AN EVOLUTIONARY ALGORITHM FOR THEOREM PROVING IN PROPOSITIONAL LOGIC.

Authors:  D. DUMITRESCU, MIHAI OLTEAN.
 
       
         
  Abstract:  Standard theorem proving algorithms normally have exponenţial complexity. This drawback could be eliminated within the Evolutionary com- putation framework. In this paper an evolutionary theorem proving method is proposed. The method is designed for propositional logic but may be ex- tended to fţrst order logic. The proposed evolutionary approach represents a new paradigm of au- tomated theorem proving. Method complexity is polynomial. Reducing time complexity with respect to non-evolutionary methods is an important feature of the proposed approach. A population of theorems is evoluated using two search operators: re- combination and mutation. Recombination operator implements Modus Po- nens inference rule. Mutation corresponds to the substitution operation.  
         
     
         
         
      Back to previous page