On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency.
Alex HornDaniel KroeningPublished in: CoRR (2015)
Keyphrases
- partial order
- boolean satisfiability
- modulo theories
- partially ordered
- conceptual graphs
- sat encodings
- total order
- pseudo boolean constraints
- declarative semantics
- sat instances
- logic programming
- stable model semantics
- sat solvers
- satisfiability problem
- sat problem
- sat solving
- lattice structure
- temporal planning
- logical formulas
- preference relations
- statistical machine translation
- search strategies
- answer set programming
- search algorithm
- logic programming language
- orders of magnitude
- causal links
- logic programs
- constraint satisfaction problems
- database systems
- stable models
- totally ordered