Automated Inference of Finite Unsatisfiability (Q5191115): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-02959-2_29 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963220690 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of the Robbins problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3150301 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5486135 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The TPTP problem library. CNF release v1. 2. 1 / rank | |||
Normal rank | |||
Latest revision as of 19:52, 1 July 2024
scientific article; zbMATH DE number 5587952
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automated Inference of Finite Unsatisfiability |
scientific article; zbMATH DE number 5587952 |
Statements
Automated Inference of Finite Unsatisfiability (English)
0 references
28 July 2009
0 references
