Fuzzy order-sorted feature logic
Gian Carlo Milanese, Gabriella Pasi

TL;DR
This paper extends order-sorted feature logic to a fuzzy setting, enabling more flexible reasoning with uncertain or imprecise information in knowledge representation.
Contribution
It introduces a fuzzy subsumption relation and semantics for OSF logic, generalizing previous crisp subsumption to handle fuzzy sets and degrees.
Findings
Defined a fuzzy subsumption relation generalizing Zadeh's inclusion.
Proved the fuzzy subsumption forms a partial order.
Developed algorithms for unification and subsumption degree computation.
Abstract
Order-Sorted Feature (OSF) logic is a knowledge representation and reasoning language based on function-denoting feature symbols and set-denoting sort symbols ordered in a subsumption lattice. OSF logic allows the construction of record-like terms that represent classes of entities and that are themselves ordered in a subsumption relation. The unification algorithm for such structures provides an efficient calculus of type subsumption, which has been applied in computational linguistics and implemented in constraint logic programming languages such as LOGIN and LIFE and automated reasoners such as CEDAR. This work generalizes OSF logic to a fuzzy setting. We give a flexible definition of a fuzzy subsumption relation which generalizes Zadeh's inclusion between fuzzy sets. Based on this definition we define a fuzzy semantics of OSF logic where sort symbols and OSF terms denote fuzzy sets.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Semantic Web and Ontologies · Natural Language Processing Techniques
