Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2749864
Jump to:navigation, search

zbMath0979.03012MaRDI QIDQ2749864

Mark E. Stickel, Han-Tao Zhang

Publication date: 21 November 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

propositional logicsatisfiability problemquasigrouppropositional clausestrie data structureDavis-Putnam method


Mathematics Subject Classification ID

Loops, quasigroups (20N05) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05) Software, source code, etc. for problems pertaining to group theory (20-04)


Related Items (3)

New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability ⋮ On SAT instance classes and a method for reliable performance experiments with SAT solvers ⋮ Efficient data structures for backtrack search SAT solvers







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2749864&oldid=15621167"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki