Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
INSTITUT FUR INFORMATIK der Ludwig-Maximilians-Universitat Munchen
 

Summary: INSTITUT F¨UR INFORMATIK
der Ludwig-Maximilians-Universit¨at M¨unchen
Diplomarbeit
The Complexity of Resolution Refinements
and Satisfiability Algorithms
Nicolas Rachinsky
Aufgabensteller: Martin Hofmann
Betreuer: Jan Johannsen, Klaus Aehlig
2
Contents
Contents 3
Declaration 5
Abstract 7
Acknowledgments 8
1 Introduction and Preliminaries 9
1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
1.2 Definitions and Preliminaries . . . . . . . . . . . . . . . . . . 10
1.2.1 Formulas . . . . . . . . . . . . . . . . . . . . . . . . . 10
1.2.2 Proof Systems . . . . . . . . . . . . . . . . . . . . . . 11
1.2.3 Resolution . . . . . . . . . . . . . . . . . . . . . . . . . 12

  

Source: Aehlig, Klaus T. - Institut für Informatik, Ludwig-Maximilians-Universität München

 

Collections: Mathematics; Computer Technologies and Information Sciences