Satisfiability of formulas from the standpoint of object classification: The RST approach

MaRDI QIDQ5506364zbMATH OpenFDO

Authors Anna Gomolińska

Publication date 28 January 2009

zbMATH Keywords

rough set theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Satisfiability and meaning of formulas and sets of formulas in approximation spaces
• Satisfiability Judgement under Incomplete Information
• scientific article; zbMATH DE number 6528599
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I
• scientific article; zbMATH DE number 1931889

Cited in

(2)

• Satisfiability and meaning of formulas and sets of formulas in approximation spaces
• Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas

This page was built for publication: Satisfiability of formulas from the standpoint of object classification: The RST approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506364)