On the semantics and automated deduction for PLFC, a logic of possibilistic uncertainty and fuzziness

Authors:
Teresa Alsinet;Lluís Godo;Sandra Sandri
Affiliations:
Computer Science Dept., Universitat de Lleida, Lleida, Spain;AI Research Inst. (IIIA), CSIC, Bellaterra, Spain;CS and Applied Math. Lab. (LAC), INPE, Brazil
Venue:
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Year:
1999

Citing 3
Cited 8

Fundamentals of fuzzy prolog

International Journal of Approximate Reasoning
Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)

A Proof Procedure for Possibilistic Logic Programming with Fuzzy Constants

ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A logic programming framework for possibilistic argumentation with vague knowledge

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Reasoning Web
Exploring Extensions of Possibilistic Logic over Gödel Logic

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

Annals of Mathematics and Artificial Intelligence
Extending possibilistic logic over Gödel logic

International Journal of Approximate Reasoning
A complete calculus for possibilistic logic programming with fuzzy propositional variables

UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
A top-k query answering procedure for fuzzy logic programming

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

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.