RegSTAB: A SAT Solver for Propositional Schemata

DOI10.1007/978-3-642-14203-1_26MaRDI QIDQ5747769zbMATH OpenOpenAlexFDO

Authors Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier

Publication date 14 September 2010

Published in Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14203-1_26

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Recommendations

• ASSAT: computing answer sets of a logic program by SAT solvers
• Regular-SAT: A many-valued approach to solving combinatorial problems
• MaxSAT resolution for regular propositional logic
• Theory and Applications of Satisfiability Testing
• raSAT: an SMT solver for polynomial constraints
• raSAT: An SMT Solver for Polynomial Constraints
• Propositional SAT solving
• scientific article; zbMATH DE number 1882048
• Mechanizing Mathematical Reasoning

Cites work

• A decidable class of nested iterated schemata
• A Schemata Calculus for Propositional Logic
• A Tableaux Method for Systematic Simultaneous Search for Refutations and Models using Equational Problems
• Complexity of the satisfiability problem for a class of propositional schemata
• Simplification rules for constrained formula tableaux

Cited in

(4)

• RegStab
• Reasoning on schemas of formulas: an automata-based approach
• raSAT: An SMT Solver for Polynomial Constraints
• Complexity of the satisfiability problem for a class of propositional schemata

This page was built for publication: RegSTAB: A SAT Solver for Propositional Schemata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747769)