Filters
Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic
In this article, the computational complexity of all axiomatic extensions of Lukasiewicz propositional logic L and the arithmetical complexity of both the general and standard semantics of their corresponding predicate ...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Admissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in ...
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
States in Lukasiewicz logic correspond to probabilities of rational polyhedra
It will be shown that probabilities of infinite-valued events represented by formulas in Lukasiewicz propositional logic are in one-to-one correspondence with tight probability measures over rational polyhedra in the unit h...
BA - Obecná matematika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
On the Complexity of Validity Degrees in Łukasiewicz Logic
the range of results by looking at validity degree in propositional Lukasiewicz logicLukasiewicz logic is an established formal system of manyvalued logic. Decision problems in both propositi...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Rough approximations in algebras of a non-associative generalization of the Lukasiewicz infinite valued logic
Commutative basic algebras are non-associative generalizations of MV-algebras. They are an algebraic counterpart of a non-associative propositional logic which generalizes the Lukasiewicz infinite valued logic and ...
IN - Informatika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
The LPi and LPi/2 Propositional and Predicate Logics.
In fuzzy logic three main logics are investigated (Godel,product and Lukasiewicz logic). There are logics LPi and LPi1/2 uniting these three logics. We show an alternative axiomatic system of thes...
BA - Obecná matematika
- 2001 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Fuzzy Logic and Piecewise-Linear Regression
McNaughton theorem of fuzzy logic states that the functions on the unit cube which admit representation by formulas of the Lukasiewicz propositional logic are exactly all continuous piecewise-linear functions (CPLF...
IN - Informatika
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
Equilibrium Semantics for IF Logic and Many-Valued Connectives
We connect two different forms of game based semantics: Hintikka’s game for Independence Friendly logic (IF logic) and Giles’s game for Lukasiewicz logic information emerges for a logic that extends both, ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Computational Complexity of t-norm based Propositional Fuzzy Logics with Rational Truth Constants
If a continuous t-norm on [0,1] maps pairs of rationals into rationals then the corresponding fuzzy propositional calculus can be extended by rational truth constants and "bookkeeping" axioms for them. (Lukasiewicz t-norm is the cla...
BA - Obecná matematika
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Many-valued Horn Logic is Hard
In this work we show that for propositional Horn clauses a finite-valued conjunction operator (in particular under finite Lukasiewicz semantics) can induce additional nondeterminism. In order to prove this, we reduce the problem of ...
IN - Informatika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 10 425