Complexity analysis of propositional resolution with autarky pruning
From MaRDI portal
Publication:1961454
DOI10.1016/S0166-218X(99)00040-2zbMath0937.68150OpenAlexW2015099359MaRDI QIDQ1961454
Publication date: 13 June 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00040-2
Related Items (1)
Cites Work
- Solving satisfiability in less than \(2^ n\) steps
- An extension to linear resolution with selection function
- Controlled integration of the cut rule into connection tableau calculi
- Autarky pruning in propositional model elimination reduces failure redundancy
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
- New methods for 3-SAT decision and worst-case analysis
- Lemma and cut strategies for propositional model elimination
- Linear resolution with selection function
- Hard examples for resolution
- A Simplified Format for the Model Elimination Theorem-Proving Procedure
- A machine program for theorem-proving
- A Unifying View of Some Linear Herbrand Procedures
- Unnamed Item
This page was built for publication: Complexity analysis of propositional resolution with autarky pruning
