Reasoning about The Past with Two-Way Automata

@inproceedings{Vardi1998ReasoningAT,
  title={Reasoning about The Past with Two-Way Automata},
  author={Moshe Y. Vardi},
  booktitle={ICALP},
  year={1998}
}
The Μ-calculus can be viewed as essentially the “ultimate” program logic, as it expressively subsumes all propositional program logics, including dynamic logics, process logics, and temporal logics. It is known that the satisfiability problem for the Μ-calculus is EXPTIME-complete. This upper bound, however, is known for a version of the logic that has only forward modalities, which express weakest preconditions, but not backward modalities, which express strongest postconditions. Our main… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 267 CITATIONS

The Finite Graph Problem for Two-Way Alternating Automata

VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Description logics: foundations for class-based knowledge representation

  • Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
  • 2002
VIEW 18 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Guarded fixed point logics and the monadic theory of countable trees

  • Theor. Comput. Sci.
  • 2002
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Description Logics for Ontologies Zusammenfassung der wissenschaftlichen

VIEW 24 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Query and Predicate Emptiness in Ontology-Based Data Access

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1998
2019

CITATION STATISTICS

  • 47 Highly Influenced Citations

  • Averaged 11 Citations per year from 2017 through 2019

  • 44% Increase in citations per year in 2019 over 2018