Sign in to access this service

Join OwlIndex or sign in to view full service details, contact info, and application options.

Sign In Sign Up

Thesis in proof complexity and knowledge compilation (M/F)

The French National Centre for Scientific Research (CNRS)
France

Summary

Study proof complexity and knowledge compilation to connect DNNF representations with proof systems for propositional counting, SAT, QBF, and MaxSAT. Theoretical analysis of DNNF-based proof formats, separations, and algorithmic and verification implications for model counting and solver trust.

Description

Sign in or sign up to view this description.

Sign In Sign Up

Contact Information

Sign in or sign up to view contact information.

Sign In Sign Up

Additional Information

Sign in or sign up to view additional information.

Sign In Sign Up

Location

Sign in or sign up to view location details.

Sign In Sign Up