Applying SAT solving in classification of finite algebras

DOI10.1007/s10817-005-9003-0zbMath1109.68103OpenAlexW1973196146MaRDI QIDQ862393

Andreas Meier, Volker Sorge

Publication date: 24 January 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://research.birmingham.ac.uk/portal/en/publications/applying-sat-solving-in-classification-of-finite-algebras(9c35fdc0-319b-476c-93a9-9ae1f7f983e8).html

zbMATH Keywords

Boolean satisfiabilitybootstrapping algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Automatic construction and verification of isotopy invariants ⋮ Efficiently checking propositional refutations in HOL theorem provers

Uses Software

• GAP
• PSATO
• SPASS
• TPTP
• SATO
• Mace4
• Chaff
• CVC Lite
• HR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single axioms for groups
• The TPTP problem library. CNF release v1. 2. 1
• Single axioms for groups and abelian groups with various operations
• Automated reasoning and exhaustive search: Quasigroup existence problems
• Automated deduction - CADE-18. 18th international conference, Copenhagen, Denmark, July 27--30, 2002. Proceedings
• Computer aided verification. 16th international conference, CAV 2004, Boston, MA, USA, July 13--17, 2004. Proceedings.
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• PSATO: A distributed propositional prover and its application to quasigroup problems
• Automated Reasoning
• Computer Aided Verification
• Computer Aided Verification