Back to Results
First PageMeta Content
Mathematics / Propositional calculus / Unsatisfiable core / Conjunctive normal form / Resolution / Logic programming / First-order logic / Logic / Mathematical logic / Automated theorem proving


MUS Extraction using Clausal Proofs Anton Belov1 , Marijn J. H. Heule2 and Joao Marques-Silva1,3 1 Complex and Adaptive Systems Laboratory, University College Dublin 2
Add to Reading List

Document Date: 2014-07-31 09:41:50

Open Document

File Size: 465,24 KB

Share Result on Facebook

City

Portland / Helsinki / /

Company

Adaptive Systems Laboratory / CNF / IOS Press / Intel / /

Country

United States / Finland / /

Facility

University College Dublin / Technical University of Lisbon / The University of Texas / /

IndustryTerm

by-product / basic deletion algorithm / basic deletion-based algorithm / recent tool / search procedure / iterative trimming algorithm / extraction tool / extraction algorithms / extraction tools / extractor tool / /

Organization

University of Texas at Austin / Technical University of Lisbon / National Science Foundation / University College Dublin / IEEE Computer Society / /

Person

Gomes / Hunt Jr / Van Gelder / Vadim Ryvchin / /

Position

extractor / MUS extractor / assumption-based MUS extractor / resolution-based MUS extractor / second author / /

Product

MUSer2 / /

ProvinceOrState

Texas / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

basic deletion algorithm / iterative trimming algorithm / artificial intelligence / CAV / basic deletion-based algorithm / MUS extraction algorithms / proposed algorithms / /

URL

http /

SocialTag