Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints.
Andreas TeuckeChristoph WeidenbachPublished in: CADE (2017)
Keyphrases
- automata theoretic
- linear constraints
- datalog queries
- query containment
- conjunctive queries
- unions of conjunctive queries
- higher order
- query answering
- first order logic
- temporal logic
- deductive databases
- linear inequalities
- constraint programming
- closed form solutions
- data complexity
- natural language processing
- equality constraints
- primary key
- global constraints
- regular path queries
- transitive closure
- information retrieval
- straight line
- constraint satisfaction
- line segments
- information extraction