Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
DOI10.1007/S10817-011-9227-0zbMATH Open1315.03035OpenAlexW2051655526MaRDI QIDQ352963FDOQ352963
Authors: Steven Schockaert, Jeroen Janssen, Dirk Vermeir 
Publication date: 5 July 2013
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-011-9227-0
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mixed integer programming (90C11) Many-valued logic (03B50) Fuzzy logic; logic of vagueness (03B52)
Cites Work
- ASSAT: computing answer sets of a logic program by SAT solvers
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Fuzzy Logic I Many‐valued rules of inference
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- SATzilla: portfolio-based algorithm selection for SAT
- Satisfiability in many-valued sentential logic is NP-complete
- A theorem about infinite-valued sentential logic
- Fuzzy description logics with general t-norms and datatypes
- Resolution and model building in the infinite-valued calculus of Łukasiewicz
- Finite-valued reductions of infinite-valued logics
- Tableaux for Łukasiewicz infinite-valued logic
- Many-valued logic and mixed integer programming
- Finiteness in infinite-valued Łukasiewicz logic
- Modelling and solving temporal reasoning as propositional satisfiability
- An asymptotically tight bound on countermodels for Łukasiewicz logic
- Title not available (Why is that?)
- Compiling Finite Linear CSP into SAT
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the failure of the finite model property in some fuzzy description logics
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
- Spatial reasoning in a fuzzy region connection calculus
Cited In (7)
- Title not available (Why is that?)
- MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
- New complexity results for Łukasiewicz logic
- Lazy evaluations in Łukasiewicz type fuzzy logic
- The MaxSAT problem in the real-valued MV-algebra
Uses Software
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)
