Pages that link to "Item:Q3502689"
From MaRDI portal
The following pages link to A Generalized Framework for Conflict Analysis (Q3502689):
Displaying 15 items.
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- Generalization of solution concepts in conflict and negotiation analysis (Q1185735) (← links)
- New measures of alliance and conflict for three-way conflict analysis (Q2237154) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- On Freezing and Reactivating Learnt Clauses (Q3007683) (← links)
- Generalized Conflict-Clause Strengthening for Satisfiability Solvers (Q3007694) (← links)
- A Generalized Framework for Conflict Analysis (Q3502689) (← links)
- A generalization of the role expectation conflict theory with a methodological analysis (Q4030249) (← links)
- Conflict analysis (Q4534239) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- Reasoning with propositional logic: from SAT solvers to knowledge compilation (Q6602252) (← links)
