Generalized modal satisfiability (Q988571): 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.1016/j.jcss.2009.10.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091470957 / 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: A unifying semantics for time and events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / 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: The complexity of concept languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal Logics for Cryptographic Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to completeness and complexity for modal logics of knowledge and belief / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of universality / 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: Q4501537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / 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: Function Algebras on Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability problems for propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief, information acquisition, and trust in multi-agent systems -- a modal logic formulation / 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: Optimal satisfiability for propositional calculi and constraint satisfaction problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On boolean lowness and boolean highness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attributive concept descriptions with complements / 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: The complexity of propositional linear temporal logics / rank
 
Normal rank

Latest revision as of 03:00, 3 July 2024

scientific article
Language Label Description Also known as
English
Generalized modal satisfiability
scientific article

    Statements

    Generalized modal satisfiability (English)
    0 references
    0 references
    0 references
    0 references
    18 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    modal logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references