The complexity of satisfiability for fragments of hybrid logic. I. (Q631087): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The computational complexity of hybrid temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Modal Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation, reasoning, and relational structures: a hybrid logic manifesto / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and Succinctness Issues for Linear-Time Hybrid Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of existential quantification in concept languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting quantifiers, successor relations, and logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of modal and temporal logics with reference pointers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Poor Man's Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability problems for propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability for fragments of hybrid logic. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of hybrid logics over equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of hybrid logics over transitive frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap-languages and log-time complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating All Solutions for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-Variable Fragments of Hybrid Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching-time logics repeatedly referring to states / rank
 
Normal rank

Latest revision as of 22:15, 3 July 2024

scientific article
Language Label Description Also known as
English
The complexity of satisfiability for fragments of hybrid logic. I.
scientific article

    Statements

    The complexity of satisfiability for fragments of hybrid logic. I. (English)
    0 references
    0 references
    22 March 2011
    0 references
    0 references
    hybrid logic
    0 references
    satisfiability
    0 references
    decidability
    0 references
    complexity
    0 references
    Post's lattice
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references