The complexity of finite model reasoning in description logics (Q2486582): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time implication problems for unary inclusion dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for First-Order Two-Variable Logic with Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attributive concept descriptions with complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank

Revision as of 14:05, 10 June 2024

scientific article
Language Label Description Also known as
English
The complexity of finite model reasoning in description logics
scientific article

    Statements

    The complexity of finite model reasoning in description logics (English)
    0 references
    0 references
    0 references
    0 references
    5 August 2005
    0 references
    Description logic
    0 references
    Finite satisfiability
    0 references
    Number restrictions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references