A SAT Approach for Maximizing Satisfiability in Qualitative Spatial and Temporal Constraint Networks.
Jean-François CondottaIssam NouaouriMichael SioutisPublished in: KR (2016)
Keyphrases
- spatial and temporal
- constraint networks
- sat problem
- constraint satisfaction problems
- satisfiability problem
- qualitative spatial and temporal reasoning
- constraint satisfaction
- interval algebra
- phase transition
- temporal reasoning
- spatio temporal
- sat instances
- stochastic local search
- maximal tractable
- spatial and temporal information
- np complete
- sat encodings
- propositional satisfiability
- tree decomposition
- space time
- constraint programming
- qualitative and quantitative
- satisfiability testing
- path consistency
- arc consistency
- sat solvers
- max sat
- temporal logic
- constraint propagation
- video frames
- backtracking search
- search algorithm
- spatial temporal
- boolean formula
- search space
- davis putnam logemann loveland
- np hard
- reasoning problems
- temporal domain
- point algebra
- temporal constraints
- cnf formula
- decision procedures
- dynamic textures