Journal Article On modal extensions of Product fuzzy logic Get access Amanda Vidal, Vidal Artificial Intelligence Research Institute (IIIA – CSIC), Campus UAB, 08193 Bellaterra, Spain. Search for other works by this author on: Oxford Academic Google Scholar Francesc Esteva, Esteva Lluis Godo E-mail: amanda@iiia.csic.es; esteva@iiia.csic.es; godo@iiia.csic.es Logic and Computation, Volume 27, Issue 1, February 2017, Pages 299–336, https://doi.org/10.1093/logcom/exv046 Published: 10 August...

One aspect that has been poorly studied in multiple-valued logics, and particular Lukasiewicz is the generation of instances varying difficulty for evaluating, comparing improving satisfiability solvers. In this paper we present a new class clausal forms, called (L-)clausal motivate their usefulness, study complexity, report on an empirical investigation shows easy-hard-easy pattern phase transition phenomenon when testing L-clausal forms.

One aspect that has been poorly studied in multiple-valued logics, and particular Łukasiewicz logic, is the generation of instances varying difficulty for evaluating, comparing improving satisfiability solvers. With ultimate goal finding challenging benchmarks solvers, we start by defining a natural intuitive class clausal forms (simple Ł-clausal forms) studying their complexity. Since prove problem simple can be solved linear time, then define two new classes (Ł-clausal restricted truly...

We study the complexity of valued CSP (VCSP, for short) over arbitrary templates, taking general framework integral bounded linearly order monoids as valuation structures. The class problems considered here subsumes and generalizes most common one in VCSP literature, since both monoidal lattice conjunction operations are allowed formulation constraints. Restricting to locally finite monoids, we introduce a notion polymorphism that captures pp-definability style Geiger’s result. As...

Abstract In this work we study the decidability of a class global modal logics arising from Kripke frames evaluated over certain residuated lattices, known in literature as many-valued logics. We exhibit large family these which are undecidable, contrast with classical logic and propositional defined same classes algebras. This includes standard Łukasiewicz Product later refine previous result, prove that not even recursively axiomatizable. conclude by closing negatively open question...

We define a tableau calculus for solving the MaxSAT problem of 3-valued Łukasiewicz logic, and prove its soundness completeness. The can be naturally extended to other finitely-valued logics. Our contributions establish foundations generic paradigm combinatorial optimization based on logic.

How can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a step towards question, taking logical model-theoretic approach fuzzy constraint satisfaction. We study positive-primitive sentences, and present an algebraic characterization classes axiomatized by kind sentences terms homomorphisms direct products. The ultimate goal is expressiveness reasoning mechanisms languages, with respect satisfaction problems and, general, modelling...