Login / Signup
Idempotent Full Paraconsistent Negations are not Algebraizable.
Jean-Yves Béziau
Published in:
Notre Dame J. Formal Log. (1998)
Keyphrases
</>
logic programming
fuzzy sets
inference rules
geometrical interpretation
morphological operators
truth values
range searching
neural network
possibilistic logic
data sets
search engine
optimal solution
computational intelligence
rough sets
arc consistency
related problems