A complete, nonredundant algorithm for reversed Skolemization (Q1059063)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complete, nonredundant algorithm for reversed Skolemization |
scientific article; zbMATH DE number 3902616 |
Statements
A complete, nonredundant algorithm for reversed Skolemization (English)
0 references
1984
0 references
The paper deals with the problem of reversing Skolemization and presents several algorithms to accomplish wholly this process. All the algorithms are written in a common language form. It is proved that the first of the algorithms is terminating, sound and non-redundant, but not complete. Therefore, the algorithm is preprocessed to the version which already has the properties of halting, soundness and completeness. From these two algorithms a third one is constructed as their combination, and its elementary properties like above are proved. Finally, the objective algorithm is presented for solving the overall process of de- Skolemization, and its termination, soundness, non-redundancy and completeness are proved.
0 references
algorithms
0 references
de-Skolemization
0 references
0 references
0 references
0.8053446
0 references
0 references
0.80502605
0 references
0.8041796
0 references
0.8037257
0 references
0.8034228
0 references
