Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-007-9084-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020169768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP algorithm to solve the unicost set covering problem / 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: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the Transversal Hypergraph Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints / rank
 
Normal rank

Latest revision as of 17:12, 27 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for computing minimal unsatisfiable subsets of constraints
scientific article

    Statements

    Algorithms for computing minimal unsatisfiable subsets of constraints (English)
    0 references
    0 references
    0 references
    18 February 2008
    0 references
    0 references
    Constraint satisfaction
    0 references
    Minimal unsatifiable subset
    0 references
    CAMUS
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references