Succinctness as a source of complexity in logical formalisms (Q1302307)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Succinctness as a source of complexity in logical formalisms
scientific article

    Statements

    Succinctness as a source of complexity in logical formalisms (English)
    0 references
    0 references
    0 references
    0 references
    22 September 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    query languages
    0 references
    succinct problems
    0 references
    quntifier-free reductions
    0 references
    expression complexity
    0 references
    second-order logic
    0 references
    weak exponential hierarchies
    0 references
    database
    0 references
    logic programming
    0 references
    nonmonotonic reasoning
    0 references
    first-order logic with Henkin quantifiers
    0 references
    default logic
    0 references
    quantifier-free interpretations
    0 references
    descriptive complexity theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references