Backdoors for linear temporal logic (Q1725638): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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/s00453-018-0515-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2891208999 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q64937504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Clausal Fragments of LTL / 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: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics in simple cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoffs in the Complexity of Backdoor Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors in the Context of Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting tractable fragments of abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures and expressiveness in the temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Normal Form for Temporal Logics and its Applications in Theorem-Proving and Execution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clausal temporal resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic. 1st International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5339289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of safety properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Past is for free: On the complexity of verifying linear temporal properties with past / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors for Linear Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of refutation Kripke models for some linear modal and tense logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of acyclic and almost acyclic CNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor sets of quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:07, 18 July 2024

scientific article
Language Label Description Also known as
English
Backdoors for linear temporal logic
scientific article

    Statements

    Backdoors for linear temporal logic (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    linear temporal logic
    0 references
    parameterized complexity
    0 references
    backdoor sets
    0 references
    0 references
    0 references
    0 references

    Identifiers