On Partial Order Semantics for SAT/SMT-Based Symbolic Encodings of Weak Memory Concurrency.
Alex HornDaniel KroeningPublished in: FORTE (2015)
Keyphrases
- partial order
- partially ordered
- boolean satisfiability
- conceptual graphs
- sat encodings
- total order
- modulo theories
- sat solving
- pseudo boolean constraints
- sat instances
- sat problem
- declarative semantics
- preference relations
- sat solvers
- satisfiability problem
- concurrency control
- logic programming
- lattice structure
- stable model semantics
- database systems
- logical formulas
- orders of magnitude
- constraint satisfaction problems
- temporal planning
- planning problems
- integer linear programming
- computational complexity
- sequential patterns
- combinatorial problems
- branch and bound algorithm