Copy complexity of Horn formulas with respect to unit read-once resolution
From MaRDI portal
Publication:2235734
DOI10.1016/j.tcs.2021.08.017OpenAlexW3197460812WikidataQ113863182 ScholiaQ113863182MaRDI QIDQ2235734
Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.08.017
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SMT-based model checking for recursive programs
- The intractability of resolution
- Why Horn formulas matter in computer science: initial structures and generic examples
- Learning conjunctions of Horn clauses
- The complexity of read-once resolution
- Finding read-once resolution refutations in systems of 2CNF clauses
- Read-once resolutions in Horn formulas
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- On unit read-once resolutions and copy complexity
- Verifying Array Programs by Transforming Verification Conditions
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Reducibility among Combinatorial Problems
- The Complexity of Finding Read-Once NAE-Resolution Refutations
- Answer Set Programming
- Combining Forward and Backward Abstract Interpretation of Horn Clauses
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas
- A Machine-Oriented Logic Based on the Resolution Principle
- The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
- HoIce: an ICE-based non-linear Horn clause solver
This page was built for publication: Copy complexity of Horn formulas with respect to unit read-once resolution
