Pages that link to "Item:Q2317509"
From MaRDI portal
The following pages link to New complexity results for Łukasiewicz logic (Q2317509):
Displaying 11 items.
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- A new face of the branching recurrence of computability logic (Q712555) (← links)
- Resolution and model building in the infinite-valued calculus of Łukasiewicz (Q1276262) (← links)
- Advances in the Ł\(\Pi\) and Ł\(\Pi\frac 12\) logics (Q1407605) (← links)
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic (Q3623218) (← links)
- A computational status update for exact rational mixed integer programming (Q5918427) (← links)
- A computational status update for exact rational mixed integer programming (Q5925645) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
- The MaxSAT problem in the real-valued MV-algebra (Q6541163) (← links)
- A \textit{DPLL} procedure with dichotomous branching for propositional product logic (Q6664542) (← links)
