Analyzing read-once cutting plane proofs in Horn systems (Q2673307): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-022-09618-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4214507692 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113901235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted cutting plane proofs in Horn constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm for Horn programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility checking in Horn constraint systems through a reduction based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input Proofs and Rank One Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4202942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn Clause Solvers for Program Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5114417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Forward and Backward Abstract Interpretation of Horn Clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is answer set programming to propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for the verification of certifying computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal length resolution refutations of difference constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of read-once resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding read-once resolution refutations in systems of 2CNF clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Read-once resolutions in Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding short resolution refutations and small unsatisfiable subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unit read-once resolutions and copy complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the independent set problem / rank
 
Normal rank

Latest revision as of 07:15, 29 July 2024

scientific article
Language Label Description Also known as
English
Analyzing read-once cutting plane proofs in Horn systems
scientific article

    Statements

    Analyzing read-once cutting plane proofs in Horn systems (English)
    0 references
    9 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references