A Computational Study of Satisfiability Algorithms for Propositional Logic (Q4319327): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.6.4.423 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048491048 / rank | |||
Normal rank | |||
Latest revision as of 20:56, 19 March 2024
scientific article; zbMATH DE number 709996
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Computational Study of Satisfiability Algorithms for Propositional Logic |
scientific article; zbMATH DE number 709996 |
Statements
A Computational Study of Satisfiability Algorithms for Propositional Logic (English)
0 references
11 January 1995
0 references
algorithms
0 references
satisfiability problem
0 references
propositional logic
0 references
tree search
0 references
