DO HARD SAT-RELATED REASONING TASKS BECOME EASIER IN THE KROM FRAGMENT?
- Published in:
- Logical Methods in Computer Science (LMCS), 2018, v. 14, n. 4, p. 1, doi. 10.23638/LMCS-14(4:10)2018
- By:
- Publication type:
- Article
Works matching IS 18605974 AND DT 2018 AND VI 14 AND IP 4
Results: 4
1
2
GAME CHARACTERIZATION OF PROBABILISTIC BISIMILARITY, AND APPLICATIONS TO PUSHDOWN AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2018, v. 14, n. 4, p. 1, doi. 10.23638/LMCS-14(4:13)2018
- By:
- Publication type:
- Article
3
REASONING WITH FINITE SETS AND CARDINALITY CONSTRAINTS IN SMT.
- Published in:
- Logical Methods in Computer Science (LMCS), 2018, v. 14, n. 4, p. 1, doi. 10.23638/LMCS-14(4:12)2018
- By:
- Publication type:
- Article
4
INTUITIONISTIC LAYERED GRAPH LOGIC: SEMANTICS AND PROOF THEORY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2018, v. 14, n. 4, p. 1, doi. 10.23638/LMCS-14(4:11)2018
- By:
- Publication type:
- Article