Fast algorithms for testing unsatisfiability of ground Horn clauses with equations (Q1100933): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:41, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for testing unsatisfiability of ground Horn clauses with equations |
scientific article |
Statements
Fast algorithms for testing unsatisfiability of ground Horn clauses with equations (English)
0 references
1987
0 references
ground Horn clauses
0 references
equational atomic formulae
0 references
congruence closure
0 references
