A-ordered tableaux (Q2785673)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A-ordered tableaux |
scientific article; zbMATH DE number 981818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A-ordered tableaux |
scientific article; zbMATH DE number 981818 |
Statements
A-ordered tableaux (English)
0 references
14 December 1997
0 references
A-orderings
0 references
ground clause tableaux
0 references
The main result of the paper is an extension of the resolution proof procedure based on A-orderings of literals (i.e., strict partial orderings respecting substitutions) to the tableau proof procedure. The authors give a simple completeness proof for A-ordered ground clause tableaux and then extend this technique to non-ground non-clausal formulas in the negation normal form by proving completeness of an A-ordered tableau procedure. It is noted that this procedure is not compatible with the connection method.
0 references
0.8354475498199463
0 references
0.8244775533676147
0 references
0.7908986806869507
0 references
0.7848246693611145
0 references
