Automatic construction of implicative theories for mathematical domains

According to Wikipedia, logic can be considered as “the use and study of valid reasoning”. In mathematics and computer sciences one is usually interested in formal logic, i.e. “the study of inference with purely formal content. An inference possesses a purely formal content if it can be expressed as a particular application of a wholly abstract rule, that is, a rule that is not about any particular thing or property.” The formality of the content under logical consideration allows one for examining the reasoning without references to particular entities. Hence, formal logic offers a uniform approach to reasoning in all possible domains.

[1]  Alfred Tarski,et al.  Distributive and Modular Laws in the Arithmetic of Relation Algebras , 1953 .

[2]  V. Duquenne,et al.  Incremental Construction of the Canonical Implication Basis , 2003 .

[3]  Artem Revenko.  Finding p-indecomposable Functions: FCA Approach , 2015, CLA.

[4]  Frank Tip,et al.  Reengineering class hierarchies using concept analysis , 1998, SIGSOFT '98/FSE-6.

[5]  Sergei O. Kuznetsov,et al.  Learning Closed Sets of Labeled Graphs for Chemical Applications , 2005, ILP.

[6]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[7]  Olivier Ridoux,et al.  Formal Concept Analysis Enhances Fault Localization in Software , 2008, ICFCA.

[8]  Artem Revenko,et al.  Attribute Exploration of Properties of Functions on Sets , 2012, Fundam. Informaticae.

[9]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

[10]  D. Hobby,et al.  The structure of finite algebras , 1988 .

[11]  Leopold Löwenheim.  Über Möglichkeiten im Relativkalkül , 1915 .

[12]  Artem Revenko.  Automatized Construction of Implicative Theory of Algebraic Identities of Size Up to 5 , 2014, ICFCA.

[13]  Ralph Freese,et al.  Automated Lattice Drawing , 2004, ICFCA.

[14]  Christian Zschalig.  An FDP-Algorithm for Drawing Lattices , 2007, CLA.

[15]  Fedor Strok.  Applying FCA toolbox to Software Testing , 2015, ArXiv.

[16]  A. Salomaa.  Review: S. V. Ablonskij, Functional Constructions in k-Valued Logic , 1964, Journal of Symbolic Logic.

[17]  M. Dehn.  Über unendliche diskontinuierliche Gruppen , 1911 .

[18]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[19]  Hans Hermes,et al.  Introduction to mathematical logic , 1973, Universitext.

[20]  Stanley Burris,et al.  Finitely many primitive positive clones , 1987 .

[21]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[22]  Frithjof Dau.  Implications of properties concerning complementation in finite lattices , 1999 .

[23]  Léonard Kwuida,et al.  GENERALIZATIONS OF BOOLEAN ALGEBRAS. AN ATTRIBUTE EXPLORATION , 2006 .

[24]  Bernhard Ganter,et al.  Contextual Attribute Logic , 1999, ICCS.

[25]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[26]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[27]  Hans-Jürgen Bürckert,et al.  On Equational Theories, Unification, and (Un)Decidability , 1989, J. Symb. Comput..

[28]  Artem Revenko.  Debugging Program Code Using Implicative Dependencies , 2013, FCA4AI@IJCAI.

[29]  Artem Revenko,et al.  Interactive error correction in implicative theories , 2014, Int. J. Approx. Reason..

[30]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[31]  Sergei O. Kuznetsov,et al.  Concept-based Recommendations for Internet Advertisement , 2009, ArXiv.

[32]  A. F. Danil'chenko.  Parametric expressibility of functions of three-valued logic , 1977 .

[33]  Alair Pereira do Lago,et al.  A convexity upper bound for the number of maximal bicliques of a bipartite graph , 2014, Discret. Appl. Math..

[34]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[35]  A. N. Prior,et al.  Equational logic , 1968, Notre Dame J. Formal Log..

[36]  Peter Baumgartner,et al.  Computing finite models by reduction to function-free clause logic , 2009, J. Appl. Log..

[37]  Bernhard Ganter,et al.  Relational Galois Connections , 2007, ICFCA.

[38]  A. V. Revenko.  Detecting mistakes in binary data tables , 2013, Automatic Documentation and Mathematical Linguistics.

[39]  Sergei O. Kuznetsov,et al.  Toxicology Analysis by Means of the JSM-method , 2003, Bioinform..

[40]  Alonzo Church,et al.  Introduction to Mathematical Logic. Volume I. , 1957 .

[41]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[42]  Peter Perkins.  Unsolvable problems for equational theories , 1967, Notre Dame J. Formal Log..