Author of the publication

Logics for Approximate Reasoning: Approximating Classical Logic "From Above".

, and . SBIA, volume 2507 of Lecture Notes in Computer Science, page 21-30. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Quantitative Logic Reasoning.. CoRR, (2019)Towards Polynomial Approximations of Full Propositional Logic.. SBIA, volume 3171 of Lecture Notes in Computer Science, page 11-20. Springer, (2004)Extending $$E\!L^++$$ with Linear Constraints on the Probability of Axioms.. Description Logic, Theory Combination, and All That, volume 11560 of Lecture Notes in Computer Science, page 286-300. Springer, (2019)Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability., and . Math. Struct. Comput. Sci., 32 (9): 1119-1144 (October 2022)Variable-Length Markov Models and Ambiguous Words in Portuguese., and . NAACL (Young Investigators Workshop), page 15-23. Association for Computational Linguistics, (2010)Non-normal Modalisation., and . Advances in Modal Logic, page 83-96. King's College Publications, (2002)Probably Half True: Probabilistic Satisfiability over Łukasiewicz Infinitely-Valued Logic., and . IJCAR, volume 10900 of Lecture Notes in Computer Science, page 194-210. Springer, (2018)Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability., , , and . SAT, volume 7962 of Lecture Notes in Computer Science, page 233-249. Springer, (2013)Probabilistic Answer Set Programming., and . BRACIS, page 150-156. IEEE Computer Society, (2013)Extending Description Logic EL++ with Linear Constraints on the Probability of Axioms.. CoRR, (2019)