Symbolic possibilistic logic: completeness and inference methods

DOI10.1093/logcom/exx046zbMath1444.03095OpenAlexW3200084497MaRDI QIDQ4684358

Dubois, Didier, Fayçal Touazi, Claudette Cayrol

Publication date: 28 September 2018

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://oatao.univ-toulouse.fr/22206/1/cayrol_22206.pdf

zbMATH Keywords

partial orderpossibilistic logichitting setsminimal inconsistent subsetsconsequence finding algorithms

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Logic in artificial intelligence (68T27)

Related Items (2)

A first polynomial non-clausal class in many-valued logic ⋮ Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations

This page was built for publication: Symbolic possibilistic logic: completeness and inference methods