The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_50 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114710125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945233 / rank
 
Normal rank
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: The Complexity of Generalized Satisfiability for Linear Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic codes and grammar refinement / 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: Tractable reasoning and efficient query answering in description logics: The DL-Lite family / 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: 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. I. / 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: 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: Q4393484 / rank
 
Normal rank

Latest revision as of 02:14, 2 July 2024

scientific article
Language Label Description Also known as
English
The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
scientific article

    Statements

    The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (English)
    0 references
    16 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    hybrid logic
    0 references
    satisfiability
    0 references
    decidability
    0 references
    complexity
    0 references
    Post's lattice
    0 references
    0 references