Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
From MaRDI portal
(Redirected from Publication:352963)
Recommendations
- New complexity results for Łukasiewicz logic
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic
- Resolution and model building in the infinite-valued calculus of Łukasiewicz
- Computational complexity of infinite-valued Łukasiewicz propositional logic
Cites work
- scientific article; zbMATH DE number 1727362 (Why is no real title available?)
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 5356404 (Why is no real title available?)
- scientific article; zbMATH DE number 1076962 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1790409 (Why is no real title available?)
- scientific article; zbMATH DE number 1903342 (Why is no real title available?)
- A theorem about infinite-valued sentential logic
- ASSAT: computing answer sets of a logic program by SAT solvers
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- An asymptotically tight bound on countermodels for Łukasiewicz logic
- Compiling Finite Linear CSP into SAT
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
- Finite-valued reductions of infinite-valued logics
- Finiteness in infinite-valued Łukasiewicz logic
- Fuzzy description logics with general t-norms and datatypes
- Many-valued logic and mixed integer programming
- Modelling and solving temporal reasoning as propositional satisfiability
- On Fuzzy Logic I Many‐valued rules of inference
- On the failure of the finite model property in some fuzzy description logics
- Resolution and model building in the infinite-valued calculus of Łukasiewicz
- SATzilla: portfolio-based algorithm selection for SAT
- Satisfiability in many-valued sentential logic is NP-complete
- Spatial reasoning in a fuzzy region connection calculus
- Tableaux for Łukasiewicz infinite-valued logic
Cited in
(8)- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- scientific article; zbMATH DE number 5158957 (Why is no real title available?)
- New complexity results for Łukasiewicz logic
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- Lazy evaluations in Łukasiewicz type fuzzy logic
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
- The MaxSAT problem in the real-valued MV-algebra
- MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions
This page was built for publication: Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352963)
