- Bazan , J. G. Dynamic Reducts and Statistical Inference, Proc. of the 6th International Conference . Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMIU '96} . Julai 1-5 , Granada, Spain. Vol III , pp. 1147 – 1152 .
- Stepaniuk , J. 1998 . “ Approximation Spaces, Reducts and Representative ” . In Rough Sets in Knowledge Discovery 2 Applications, Case Studies and Software Systems , Edited by: Polkowski , L. and Skowron , A. 109 – 126 . Heidelberg : Physica-Verlag .
- Wroblewski , J. Finding Minimal Reducts Using Genetic Algorithm . Proc. of the 2nd Annual Join Conference on Information Science . Sept 28 . pp. 186 – 189 . Okt. 1
- Silva , J. P. M. 1997 . On Computing Minimum Size Prime Implicant International Workshop on Logic Synthesis . May 1997 . URL:http://vinci.inesc.pt/jpms/recent-publications.html/
- Silva , J. P. M. and Sakallah , K. A. 1999 . “GRASP: A Search Algorithm for Prepositional Satisfiability” . IEEE Transactions on Computers , 48 (5} ) : 506 – 521 .
- Pawlak , Z. 1991 . Rough Set: Theoretical Aspect of Reasoning about Data , Kluwer Publications .
- Mollestad , T. and Komorowski , J.A . 1998 . “ Rough Set Framework of Prepositional Default Rules Data Mining ” . In Fuzzy Sets, Rough Sets and Decision Making Processes , Edited by: Pal , S. K. and Skowron , A. Springer-Verlag Singapore Pte Ltd. .
- Hillier , F.S and Lieberman , J. G. 1989 . Introduction to Operations Research , McGraw Hill .
- Freeman , J. W. 1995 . Improvements to Propositioned Satisfiability Search Algorithm , University of Pennsylvania . PhD Thesis
- Murphy, P. M. UCI Repositories of Machine Learning and Domain Theories. http://www.ics.uci.edu/mlearn/MLRepository.html. (http://www.ics.uci.edu/mlearn/MLRepository.html.)
- Jenssen , T. K. , Komorowski , K. and Ohrm . 1998 . A. Some Heuristic for Default Knowledge Discovery. Lecture Notes in Artificial Intelligence , Vol 1424 , 373 – 380 . Springer-Verlag .
- Ohrm , A. 1998 . ROSETTA technical Reference Manual Knowlegde System Group , Trondheim, , Norway : Norwegian University of Science and Technology .
Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.