Domain-independent formulas and databases (Q1092679): 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.1016/0304-3975(87)90113-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976814050 / rank | |||
Normal rank | |||
Revision as of 20:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Domain-independent formulas and databases |
scientific article |
Statements
Domain-independent formulas and databases (English)
0 references
1987
0 references
A proof theoretic characterization of domain-independent formulas in deductive databases is given. On the basis of equivalence to domain- independent formulas, a new class of formulas called ``allowed'' is defined. This leads to the proposed new notion of ``allowed'' databases. It is proved that every allowed database that is definite or hierarchical is domain-independent and that every domain-independent database has an equivalent allowed database (in a certain sense).
0 references
logic programming
0 references
proof theoretic characterization of domain-independent formulas
0 references
deductive databases
0 references
domain-independent database
0 references
