First-order rewritability of ontology-mediated queries in linear temporal logic

Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo et al. · Journal of Automated Reasoning · 2007 · 1.4K citations

Computing, Computer Science, Mathematics +15

An Automata-Theoretic Approach to Automatic Program Verification

Moshe Y. Vardi, Pierre Wolper · ORBi (University of Liège) · 1986 · 1.3K citations · Full text

Computing, Computer Engineering, Computer Science +14

The complexity of propositional linear temporal logics

A. Prasad Sistla, E. M. Clarke · Journal of the ACM · 1985 · 1.1K citations · Full text

Humanities, Computer Science, Mathematics +12

Parity, circuits, and the polynomial-time hierarchy

Merrick L. Furst, James B. Saxe, Michael Sipser · Theory of Computing Systems · 1984 · 939 citations

Computing, Computer Engineering, Computer Science +11

Weak Second‐Order Arithmetic and Finite Automata

J Büchi · Mathematical logic quarterly · 1960 · 819 citations

Computing, Computer Science, Mathematics +9