Complexity of propositional projection temporal logic with star (Q3616217): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A decision procedure for propositional projection temporal logic with infinite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Framed temporal logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Propositional Projection Temporal Logic with Infinite Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process logic: Expressiveness, decidability, completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Implication Problem for Functional and Inclusion Dependencies is Undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness of temporal logics over infinite intervals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank

Latest revision as of 05:04, 29 June 2024

scientific article
Language Label Description Also known as
English
Complexity of propositional projection temporal logic with star
scientific article

    Statements

    Complexity of propositional projection temporal logic with star (English)
    0 references
    0 references
    0 references
    24 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    temporal logic
    0 references
    complexity
    0 references
    satisfiability
    0 references
    emptiness problem
    0 references
    decidability
    0 references
    algorithm
    0 references