Login / Signup
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable.
Klaus Aehlig
Jolie G. de Miranda
C.-H. Luke Ong
Published in:
TLCA (2005)
Keyphrases
</>
datalog programs
transitive closure
deductive databases
datalog queries
higher order
relational structures
fixpoint
theoretical framework
logic programs
function symbols
theoretical basis
query answering
levels of abstraction
satisfiability problem
conjunctive queries
complex objects
first order logic