Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
From MaRDI portal
Publication:352963
DOI10.1007/s10817-011-9227-0zbMath1315.03035OpenAlexW2051655526MaRDI QIDQ352963
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
Mixed integer programming (90C11) Fuzzy logic; logic of vagueness (03B52) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Many-valued logic (03B50)
Related Items (3)
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers ⋮ MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions ⋮ Lazy evaluations in Łukasiewicz type fuzzy logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the failure of the finite model property in some fuzzy description logics
- ASSAT: computing answer sets of a logic program by SAT solvers
- Spatial reasoning in a fuzzy region connection calculus
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Fuzzy description logics with general t-norms and datatypes
- Satisfiability in many-valued sentential logic is NP-complete
- 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
- Compiling Finite Linear CSP into SAT
- On Fuzzy Logic I Many‐valued rules of inference
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
- A theorem about infinite-valued sentential logic
This page was built for publication: Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
