Skip to main content
Conference Proceedings

Propositional compilation for all normal parameter reductions of a soft set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8818 184-193
DOI: 10.1007/978-3-319-11740-9_18
7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a method for compiling all the normal parameter reductions of a soft set into a conjunction of disjunctive normal form, which is generated by parameter boolean atomic formulas. A subset of parameter set is a normal parameter reduction if and only if the characteristic function of its complementary set is a model of this proposition. Three rules for simplifying this job are developed and combined.

Author supplied keywords

Cite

CITATION STYLE

APA

Han, B., & Li, X. (2014). Propositional compilation for all normal parameter reductions of a soft set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8818, pp. 184–193). Springer Verlag. https://doi.org/10.1007/978-3-319-11740-9_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free