SAT Solvers for Queries over Tree Automata with Constraints.
Pierre-Cyrille HéamVincent HugotOlga KouchnarenkoPublished in: ICST Workshops (2010)
Keyphrases
- tree automata
- sat solvers
- constraint satisfaction
- regular expressions
- finite automata
- query language
- monadic second order logic
- finite state
- query processing
- orders of magnitude
- sat encodings
- propositional satisfiability
- search strategies
- max sat
- sat problem
- search space
- database
- retrieval systems
- context free grammars
- sat instances
- weighted max sat
- search strategy
- query evaluation
- constraint satisfaction problems
- xml documents
- reinforcement learning
- metadata
- information retrieval