Attribute exploration of properties of functions on sets

Fundamenta Informaticae

Volumn 115, Issue 4, 2012, Pages 377-394

  Revenko, Artem ^a   Kuznetsov, Sergei O ^a  

^a NATIONAL RESEARCH UNIVERSITY HIGHER SCHOOL OF ECONOMICS   (Russian Federation)

Author keywords

Attribute Exploration; Implication Basis; Properties of Functions

Indexed keywords

ATTRIBUTE EXPLORATION; FUNCTION PROPERTIES; IDEMPOTENCY; IMPLICATION BASIS; MONOTONICITY; PATH INDEPENDENCE;

INFORMATION SYSTEMS;

COMPUTATIONAL METHODS;

EID: 84861412793     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2012-660     Document Type: Article

References (17)

1. Aizerman, M., Aleskerov, F.: Theory of Choice, North-Holland/Elsevier, Amsterdam, 1995.
2. Aizerman, M., Malishevskiy, A.: General theory of best variants choice, IEEE Trans. Automatic Control, AC-26(5), 1981, 1030-1040. (Pubitemid 12439153)
3. Babin, M., Kuznetsov, S. O.: Recognizing Pseudo-Intent is coNP-complete, Proc. 7th International Confer- ence on Concept Lattices and Their Applications, University of Sevilla, 2010, 294-301.
4. Birkhoff, G.: Lattice Theory, 3rd edition, Am. Math. Soc., Providence, RI, 1967.
5. Danilov, V., Koshevoy, G.: A new characterization of the path independent choice functions, Mathematical Social Sciences, 51, 2006, 238-245. (Pubitemid 43246118)
6. Dau, F.: Implications of properties concerning complementation in finite lattices, In: Contributions to Gen- eral Algebra 12 (D. Dorninger et al., eds.), Proceedings of the 58th workshop on general algebra "58. Arbeitstagung Allgemeine Algebra", Vienna, Austria, June 3-6, 1999, Verlag Johannes Heyn, Klagenfurt, 2000, 145-154.
7. Felix Distel, B. S.: On the complexity of enumerating pseudo-intents, Discrete Applied Mathematics, 159, 2011, 450-466.
8. Ganter, B.: Two Basic Algorithms in Concept Analysis, Preprint-Nr. 831, 1984.
9. Ganter, B., Wille, R.: Formal Concept Analysis : Mathematical Foundations, Springer, 1999.
10. Guigues, J.-L., Duquenne, V.: Familles minimales d'implications informatives r-esultant d'un tableau de donn-ees binaires, Math. Sci. Hum, 24(95), 1986, 5-18.
11. Koshevoy, G.: Choice functions and abstract convex geometries, Mathematical Social Sciences, 38(5), 1999, 35-44.
12. Kuznetsov, S. O.: On Complexity of Computing the Duquenne-Guigues Basis, Journal of Universal Com- puter Science, 10(8), 2004, 927-933.
13. H.: Choice functions over finite sets: a summary, Soc. Choice Welf., 2, 1985, 147-160
14. Obiedkov, S., Duquenne, V.: Incremental Construction of the Canonical Implication Basis, Proc. of JIM 2003, Metz, France, 2003.
15. Plott, C.: Path independence, rationality and social choice, Econometrica, 41, 1973, 1075-1091.
16. S. O. Kuznetsov, S. O.: Some Decision and Counting Problems of the Duquenne-Guigues Basis of Implications, Discrete Applied Mathematics, 156(11), 2008, 1994-2003.
17. Sen, A.: Choice functions and revealed preference, Review of Economics Studies, 38, 1971, 307-313.