On the Semantics and Automated Deduction for PLFC, a Logic of Possibilistic Uncertainty and Fuzziness
Abstract
inconsistent Recently, a syntactical extension of first order Possibilistic logic (called PLFC) dealing with fuzzy constants and fuzzily restricted quantifiers has been proposed. In this paper we present steps towards both the formalization of PLFC itself and an automated deduction system for it by (i) providing a formal semantics; (ii) defining a sound resolution-style calculus by refutation; and (iii) describing a first-order proof procedure for PLFC clauses based on (ii) and on a novel notion of most general substitution of two literals in a resolution step.
Cite
Text
Alsinet et al. "On the Semantics and Automated Deduction for PLFC, a Logic of Possibilistic Uncertainty and Fuzziness." Conference on Uncertainty in Artificial Intelligence, 1999.Markdown
[Alsinet et al. "On the Semantics and Automated Deduction for PLFC, a Logic of Possibilistic Uncertainty and Fuzziness." Conference on Uncertainty in Artificial Intelligence, 1999.](https://mlanthology.org/uai/1999/alsinet1999uai-semantics/)BibTeX
@inproceedings{alsinet1999uai-semantics,
title = {{On the Semantics and Automated Deduction for PLFC, a Logic of Possibilistic Uncertainty and Fuzziness}},
author = {Alsinet, Teresa and Godo, Lluís and Sandri, Sandra A.},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1999},
pages = {3-12},
url = {https://mlanthology.org/uai/1999/alsinet1999uai-semantics/}
}