Weighted monadic Datalog

DOI10.1016/j.tcs.2008.04.025zbMath1155.68023OpenAlexW2075018493MaRDI QIDQ944376

Torsten Stüber, Heiko Vogler

Publication date: 16 September 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.025

zbMATH Keywords

weighted tree automataunranked treesmonadic Datalogsemiring-based logic programming

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Logic programming (68N17) Information storage and retrieval of data (68P20)

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of weighted automata
• Weighted tree automata and weighted logics
• Weighted grammars and Kleene's theorem
• Recognizable formal power series on trees
• Equational elements in additive algebras
• Cut and paste
• Query automata over finite trees
• Weighted automata and weighted logics
• Weighted path queries on semistructured databases
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree acceptors and some of their applications
• Generalizations of regular sets and their application to a study of context-free languages
• Semiring-based constraint satisfaction and optimization
• Computer Science Logic
• Monadic datalog and the expressive power of languages for Web information extraction
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Automata, Languages and Programming
• Soft constraint logic programming and generalized shortest path problems

This page was built for publication: Weighted monadic Datalog