Automata theoretic and Datalog based solutions of Monadic Second order Logic Evaluation Problems over Structures of bounded treewidth

Labrini Kalantzi University Of Athens 0.1cm (Joint Work With E. Foustoucos)

Description

Automata-theoretic Solution Datalog algorithms for the MSO evaluation problem Automata-theoretic and Datalog-based solutions of MSO Evaluation Problems over Structures of bounded-treewidth Labrini Kalantzi University of Athens (joint work with E. Foustoucos) 2nd Workshop on Graph Decompositions Theoretical, Algorithmic and Logical Aspects October 18-22, 2010 CIRM, Luminy, Marseille CIRM, 18-22 Oct. 2010 Automata & Datalog solutions of MSO Evaluation Problems

• over structures


• datalog algorithms


• theoretic solution


• deterministic bottom-up


• main theorem


• mso evaluation


• direct automata-theoretic reduction


• automata

Sujets

• Autómata

Informations

• Publié par: pefav
• Nombre de lectures: 19
• Langue: English

Extrait

Automata-theoreticSolution DatalogalgorithmsfortheMSOevaluationproblem Automata-theoreticandDatalog-basedsolutions ofMSOEvaluationProblems overStructuresofbounded-treewidth LabriniKalantzi UniversityofAthens (jointworkwithE.Foustoucos) 2ndWorkshoponGraphDecompositions Theoretical,AlgorithmicandLogicalAspects CIMR CIR Oc M t , ob L e u r m 1 i 8 n - y 2 , 2, Ma 2 r 0 s 1 e 0 ille ,81-22cO.t0201uAotmtaa&aDatlgoosltuinosfoSMOEavlauitnoPorlbems