A comprehensive framework for saturation theorem proving

HIGHLIGHTS

• who: Uwe Waldmann from the Max-Planck-Institut fu00fcr Informatik, Saarland Informatics Campus, Saarbru00fccken, Germany have published the research work: A Comprehensive Framework for Saturation Theorem Proving, in the Journal: (JOURNAL)
• what: The authors show that this approach can be generalized and modularized: First, any redundancy criterion that is obtained by lifting a ground criterion can be extended to a redundancy criterion that supports subsumption without affecting static refutational completeness. The authors show how to perform this lifting abstractly, given a suitable grounding function G. G Next, the authors show that (Red I, Red F . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.