An Automata Theoretic Decidability Proof for First-Order Theory of ⟨ℕ,<,P⟩ with Morphic Predicate P.

Published in: J. Autom. Lang. Comb. (1999)

Keyphrases

automata theoretic
temporal logic
first order logic
unions of conjunctive queries
data exchange
decision procedures
regular path queries
query answering
theorem prover
model theoretic
horn clauses
description logics
special case
theorem proving
database
query containment
modal logic
databases