Algorithms for computing minimal equivalent subformulas (Q460638): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(11 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2014.07.011 / rank
Normal rank
 
Property / author
 
Property / author: João P. Marques-Silva / rank
Normal rank
 
Property / author
 
Property / author: João P. Marques-Silva / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bloqqer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PicoSAT / 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: QUICKXPLAIN / 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.1016/j.artint.2014.07.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091072454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in logic. I: CNF propositional formulae / 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: On the power of clause-learning SAT solvers as resolution engines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical and algorithmic properties of stable conditional independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failed Literal Detection for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocked Clause Elimination for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing propagation redundant constraints in redundant modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints / 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: On Improving MUS Extraction Algorithms / 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: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / 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: Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards efficient MUS extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MUST: Provide a Finer-Grained Explanation of Unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Representation of Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal compression of propositional Horn knowledge bases: Complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in logic. II: 2CNF and Horn propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in logic. III: Non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating Redundant Clauses in SAT Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inprocessing Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Simplifying Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-level logic minimization: an overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Boolean formula minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Guaranteed MUSes Fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Combination of Decision Procedures for MUS Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The scaling window of the 2-SAT transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2014.07.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Algorithms for computing minimal equivalent subformulas
scientific article

    Statements

    Algorithms for computing minimal equivalent subformulas (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 2014
    0 references
    Boolean satisfiability
    0 references
    redundancy
    0 references
    irredundant subformula
    0 references
    minimal unsatisfiability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers