A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic

DOI10.1007/978-3-319-08587-6_27zbMATH Open1423.68414OpenAlexW218401682MaRDI QIDQ3192206FDOQ3192206

Rüdiger Ehlers, Martin Lange

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08587-6_27

Recommendations

• A tool for deciding the satisfiability of continuous-time metric temporal logic
• Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals
• Temporal induction by incremental SAT solving
• An incremental algorithm to check satisfiability for bounded model checking
• On the satisfiability of indexed linear temporal logics
• Finite satisfiability of interval temporal logic formulas with multi-objective metaheuristics
• Exact Incremental Analysis of Timed Automata with an SMT-Solver
• Fast(er) reasoning in interval temporal logic
• scientific article; zbMATH DE number 1670826

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cited In (2)

• Title not available (Why is that?)
• Temporal induction by incremental SAT solving

This page was built for publication: A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192206)