Pages that link to "Item:Q5437652"
From MaRDI portal
The following pages link to Logic programming with satisfiability (Q5437652):
Displaying 10 items.
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Tableau reasoning for description logics and its extension to probabilities (Q1653448) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Abstract interpretation of microcontroller code: intervals meet congruences (Q2442953) (← links)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
- Proving Termination with (Boolean) Satisfaction (Q5504589) (← links)
- Transfer Function Synthesis without Quantifier Elimination (Q5892491) (← links)
