An Optimal Decision Procedure for MPNL over the Integers

    GandALF, pp. 192-206, 2011.

    Cited by: 3|Bibtex|Views1|Links
    EI
    Keywords:
    linear ordercomputational complexitysatisfiabilityinterval temporal logic

    Abstract:

    Interval temporal logics provide a natural framework for qualitative and quantitative temporal reason- ing over interval structures, where the truth of formulae is defined over intervals rather than points. In this paper, we study the complexity of the satisfiability problem for Metric Propositional Neigh- borhood Logic (MPNL). MPNL fea...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments