An annotated logic theorem prover for an extended possibilistic logic

DOI10.1016/j.fss.2003.10.014zbMath1076.68087OpenAlexW2044689001MaRDI QIDQ598578

Peter Kullmann, Sandra Aparecida Sandri

Publication date: 6 August 2004

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2003.10.014

zbMATH Keywords

Fuzzy setsPossibilistic logicAnnotated logicPLFC

Mathematics Subject Classification ID

Related Items (8)

Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants ⋮ An annotated logic theorem prover for an extended possibilistic logic ⋮ A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\) ⋮ A comparison of fuzzy and annotated logic programming ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification

Uses Software

• KOMET

Cites Work

• An annotated logic theorem prover for an extended possibilistic logic
• Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification
• Mechanical Theorem-Proving by Model Elimination
• Unnamed Item

This page was built for publication: An annotated logic theorem prover for an extended possibilistic logic