A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mark H. Liffiton / rank
 
Normal rank
Property / author
 
Property / author: João P. Marques-Silva / rank
 
Normal rank
Property / author
 
Property / author: Karem A. Sakallah / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CEGAR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MUP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AMUSE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10601-008-9058-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966998067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistent subsets of inconsistent systems: structure and behaviour / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local-search extraction of mUSes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / 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: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable / rank
 
Normal rank

Latest revision as of 04:02, 2 July 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
scientific article

    Statements

    A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 November 2009
    0 references
    Boolean satisfiability
    0 references
    infeasibility
    0 references
    MUS
    0 references
    SMUS
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers