The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U - Automated theorem proving - Document - PDFSEARCH.IO

First Page	Meta Content
	The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U Add to Reading List Document Date: 2011-06-15 11:37:40 Open Document File Size: 258,88 KB Share Result on Facebook

The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, UAdd to Reading List