Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories.
Khalil DjelloulThi-Bich-Hanh DaoPublished in: SAC (2006)
Keyphrases
- finitely representable
- theory revision
- theoretical framework
- quantifier free
- general theory
- equational theories
- logical theories
- action theories
- linear programming problems
- real numbers
- linear arithmetic constraints
- finite sets
- decision trees
- first order logic
- propositional theories
- quantifier elimination
- integer program
- np complete
- classical first order logic
- domain theory
- probability theory
- sat encodings
- formal models
- computational models
- design theory
- decision theory
- update operations
- mixed integer program
- constraint satisfaction
- theoretical models
- constraint programming
- finite number
- finite dimensional
- constraint problems
- constrained problems
- constrained optimization
- nonlinear programming
- cognitive psychology
- linear programming
- linear constraints
- knowledge representation
- mixed integer