Propositional Compilation for All Normal Parameter Reductions of a Soft Set

DOI10.1007/978-3-319-11740-9_18MaRDI QIDQ2949608zbMATH OpenOpenAlexFDO

Authors Bang He Han, Xiaonan Li

Publication date 2 October 2015

Published in Rough Sets and Knowledge Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11740-9_18

zbMATH Keywords

soft setdisjunctive normal formnormal parameter reduction

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Characterizations of normal parameter reductions of soft sets
• The parameterization reduction of soft sets and its applications
• The normal parameter reduction of soft sets and its algorithm
• On the parameter reduction of soft binary relations
• A new efficient normal parameter reduction algorithm of soft sets
• Parameter significance and reductions of soft sets
• Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Compact normal forms in propositional logic and integer programming formulations
• On compact representations of propositional circumscription

Cited in

(1)

• Comments on: ``Normal parameter reduction in soft set based on particle swarm optimization algorithm

This page was built for publication: Propositional Compilation for All Normal Parameter Reductions of a Soft Set

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