Pages that link to "Item:Q1100196"
From MaRDI portal
The following pages link to Satisfiability in many-valued sentential logic is NP-complete (Q1100196):
Displaying 44 items.
- Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras (Q278739) (← links)
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- Complexity of fuzzy answer set programming under Łukasiewicz semantics (Q465597) (← links)
- Automated theorem proving for Łukasiewicz logics (Q687151) (← links)
- Complexity issues in Basic Logic (Q816857) (← links)
- Equilibrium logic (Q854969) (← links)
- The coherence of Łukasiewicz assessments is NP-complete (Q985139) (← links)
- The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete (Q1006641) (← links)
- On the refutational completeness of signed binary resolution and hyperresolution (Q1037933) (← links)
- The complexity of McNaughton functions of one variable (Q1271879) (← links)
- Resolution and model building in the infinite-valued calculus of Łukasiewicz (Q1276262) (← links)
- Logic of infinite quantum systems (Q1325668) (← links)
- Turing complexity of Behncke-Leptin \(C^*\)-algebras with a two-point dual (Q1354006) (← links)
- On the relationship between fuzzy autoepistemic logic and fuzzy modal logics of belief (Q1677044) (← links)
- Proof search and co-NP completeness for many-valued logics (Q1697337) (← links)
- On generalized hoops, homomorphic images of residuated lattices, and (G)BL-algebras (Q1699728) (← links)
- Complexity of some language fragments of fuzzy logics (Q1699732) (← links)
- On finite-valued propositional logical calculi (Q1913635) (← links)
- Many-valued logic and mixed integer programming (Q1924752) (← links)
- On the complexity of validity degrees in Łukasiewicz logic (Q2106603) (← links)
- Poset products as relational models (Q2115284) (← links)
- Constraint tableaux for two-dimensional fuzzy logics (Q2142061) (← links)
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics (Q2209555) (← links)
- An efficient algorithm for representing piecewise linear functions into logic (Q2229157) (← links)
- Universal properties of Łukasiewicz consequence (Q2254556) (← links)
- MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions (Q2282273) (← links)
- New complexity results for Łukasiewicz logic (Q2317509) (← links)
- Lazy evaluations in Łukasiewicz type fuzzy logic (Q2329100) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- Making fuzzy description logic more general (Q2386237) (← links)
- An asymptotically tight bound on countermodels for Łukasiewicz logic (Q2506811) (← links)
- Extending the reach of SAT with many-valued logics (Q2741541) (← links)
- The Differential Semantics of Łukasiewicz Syntactic Consequence (Q2948587) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988 (Q3478381) (← links)
- Simple Bratteli diagrams with a Gödel-incomplete C*-equivalence problem (Q4452268) (← links)
- Jan Łukasiewicz Life, Work, Legacy (Q5056078) (← links)
- Effective Finite-Valued Approximations of General Propositional Logics (Q5452176) (← links)
- Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability (Q5889305) (← links)
- Introduction (Q5892200) (← links)
- Complexity of t-tautologies (Q5957903) (← links)
- Rational Pavelka logic: the best among three worlds? (Q6083147) (← 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)