A satisfiability tester for non-clausal propositional calculus

DOI10.1016/0890-5401(88)90014-4zbMath0658.68107OpenAlexW2024066799MaRDI QIDQ1111774

Allen van Gelder

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90014-4

zbMATH Keywords

propositional calculusalgorithm for satisfiability testingdivide and conquer algorithm

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (9)

An improved upper bound for SAT ⋮ An Improved SAT Algorithm in Terms of Formula Length ⋮ Further improvements for SAT in terms of formula length ⋮ An artificial neural network satisfiability tester ⋮ New methods for 3-SAT decision and worst-case analysis ⋮ The \(Multi\)-SAT algorithm ⋮ Reductions for non-clausal theorem proving ⋮ Tractable reasoning via approximation ⋮ A fast algorithm for SAT in terms of formula length

Cites Work

• On the complexity of regular resolution and the Davis-Putnam procedure
• A Computing Procedure for Quantification Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A satisfiability tester for non-clausal propositional calculus