Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Generation of Unsatisfiability Proofs and Cores in SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach for extracting a small unsatisfiable core / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing minimal unsatisfiable subsets of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Guaranteed MUSes Fast / rank
 
Normal rank

Latest revision as of 04:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Faster Extraction of High-Level Minimal Unsatisfiable Cores
scientific article

    Statements