Pages that link to "Item:Q5756567"
From MaRDI portal
The following pages link to Satisfiability Checking of Non-clausal Formulas Using General Matings (Q5756567):
Displaying 5 items.
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (Q2829996) (← links)
- A View from the Engine Room: Computational Support for Symbolic Model Checking (Q3512438) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900325) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)
- Formula normalizations in verification (Q6535699) (← links)