Making Automatic Theorem Provers more Versatile Simon Cruanes Veridis, Inria Nancy https: cedeela.fr ~simon August 2017 - Science of Science Tool - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2017-08-08 03:28:32 Theoretical computer science Formal methods Mathematical logic Logic in computer science Mathematics Constraint programming Automated theorem proving Satisfiability modulo theories Formal verification Type theory First-order logic Vampire		Making Automatic Theorem Provers more Versatile Simon Cruanes Veridis, Inria Nancy https://cedeela.fr/~simon/ August 2017 Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 371,90 KB Share Document on Facebook

	Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson DocID: 1xUdh - View Document
	PDF Document DocID: 1xSrV - View Document
	Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka DocID: 1vleR - View Document
	Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995 DocID: 1v7SC - View Document
	Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be DocID: 1v72L - View Document