Subsumption and implication (Q1094152): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/ipl/Gottlob87, #quickstatements; #temporary_batch_1731530891435
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90103-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989242777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Specialization of Programs by Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of subsumption algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ipl/Gottlob87 / rank
 
Normal rank

Latest revision as of 21:59, 13 November 2024

scientific article
Language Label Description Also known as
English
Subsumption and implication
scientific article

    Statements

    Subsumption and implication (English)
    0 references
    1987
    0 references
    Implication is compared with subsumption, the usual test in databases. Subsumption implicates ``implication'', but the converse does not hold. It is shown, however, that if the axiom is not self-resolving and the consequence is not tautological, then implication is equivalent to subsumption. Some consequences and algorithms are also considered.
    0 references
    subsumption
    0 references
    databases
    0 references
    implication
    0 references
    0 references

    Identifiers