Title	Advances in QBF Solving
Creator	Janota, Mikoláš
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-08-29T09:04
Description	In this talk I will review the recent progress in the solving of Quantified Boolean Formulas (QBF). The initial research on QBF solving focused on extending SAT technology. However, in the recent approaches SAT solvers are used in a black-box fashion and the search space is pruned by stronger constraints than just clauses. The study of QBF has also revealed a number of limitations of the existing technology. Recent results show that some of these limitations can be tackled by applying Machine Learning at the semantic level.
Extent	61.0
Subject	Mathematics; Computer science; Mathematical logic and foundations; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: IST/INESC-ID, U. of Lisbon
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-04-01
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377715
URI	http://hdl.handle.net/2429/69377
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Researcher
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos