Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201)

This report documents the program and the outcomes of Dagstuhl Seminar 14201 "Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications". The seminar brought together researchers working in various areas of mathematics and computer science, mostly in algebra, logic, date base theory, artificial intelligence and data mining. A key objective of the seminar has been to bring together a critical mass of researchers and to provide a platform for personal contacts and scientific interchange between the different disciplines in an atmosphere that will stimulate collaboration and lead to new partnerships. The goal was to crystallize the main research directions and to disseminate challenging open problems across the different research areas.

[1]  Sergei A. Obiedkov.  Modeling Ceteris Paribus Preferences in Formal Concept Analysis , 2013, ICFCA.

[2]  Bernard Mourrain,et al.  Dimensions and bases of hierarchical tensor-product splines , 2014, J. Comput. Appl. Math..

[3]  Sergei O. Kuznetsov,et al.  Fitting Pattern Structures to Knowledge Discovery in Big Data , 2013, ICFCA.

[4]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[5]  Yutaka Ohtake,et al.  Motorcycle graph enumeration from quadrilateral meshes for reverse engineering , 2014, Comput. Aided Des..

[6]  Vincent Duquenne,et al.  Contextual Implications between Attributes and Some Representation Properties for Finite Lattices , 2013, ICFCA.

[7]  Rosa Camps,et al.  Social choice rules driven by propositional logic , 2011, Annals of Mathematics and Artificial Intelligence.

[8]  Denis Zorin,et al.  Worst-case structural analysis , 2013, ACM Trans. Graph..

[9]  Lhouari Nourine,et al.  Enumeration of Minimal Dominating Sets and Variants , 2011, FCT.

[10]  Amedeo Napoli,et al.  Relational concept analysis: mining concept lattices from multi-relational data , 2013, Annals of Mathematics and Artificial Intelligence.

[11]  Rohit Gheyi,et al.  Identifying overly strong conditions in refactoring implementations , 2011, 2011 27th IEEE International Conference on Software Maintenance (ICSM).

[12]  Felix Distel,et al.  On the complexity of enumerating pseudo-intents , 2011, Discret. Appl. Math..

[13]  Sergei O. Kuznetsov,et al.  Complexity of learning in concept lattices from positive and negative examples , 2004, Discret. Appl. Math..

[14]  Takeaki Uno,et al.  On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs , 2013, ISAAC.

[15]  Lhouari Nourine,et al.  On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets , 2012, ISAAC.

[16]  Zainab Assaghir,et al.  Embedding tolerance relations in formal concept analysis: an application in information fusion , 2010, CIKM '10.

[17]  Vincent Duquenne.  Some Variations on Alan Day's Algorithm for Calculating Canonical Basis of Implications , 2007, CLA.

[18]  Emmanuel Coquery,et al.  Query Rewriting for Rule Mining in Databases , 2013 .

[19]  Rosa Camps,et al.  A general method for deciding about logically constrained issues , 2010, Annals of Mathematics and Artificial Intelligence.

[20]  Hod Lipson,et al.  Fabricated: The New World of 3D Printing , 2013 .

[21]  Bernard Mourrain,et al.  On the problem of instability in the dimension of a spline space over a T-mesh , 2012, Comput. Graph..

[22]  Sergei O. Kuznetsov,et al.  Scalable Knowledge Discovery in Complex Data with Pattern Structures , 2013, PReMI.

[23]  Bernhard Ganter,et al.  Concept-Based Data Mining with Scaled Labeled Graphs , 2004, ICCS.

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

[25]  Daniele Porello,et al.  A Proof-Theoretical View of Collective Rationality , 2013, IJCAI.

[26]  Sergei O. Kuznetsov,et al.  Mathematical aspects of concept analysis , 1996 .

[27]  Johan van Benthem,et al.  Everything Else Being Equal: A Modal Logic for Ceteris Paribus Preferences , 2009, J. Philos. Log..

[28]  Tae-wan Kim,et al.  Bases of T-meshes and the refinement of hierarchical B-splines , 2014, ArXiv.

[29]  Sergei O. Kuznetsov,et al.  Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices , 2011, ICFCA.

[30]  Wojciech Matusik,et al.  Spec2Fab , 2013, ACM Trans. Graph..

[31]  Jun Wang,et al.  Freeform Honeycomb Structures , 2014, Comput. Graph. Forum.

[32]  Chedy Raïssi,et al.  On Projections of Sequential Pattern Structures (with an Application on Care Trajectories) , 2013, CLA.

[33]  Sergei O. Kuznetsov,et al.  Computing premises of a minimal cover of functional dependencies is intractable , 2013, Discret. Appl. Math..

[34]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[35]  Jan Kautz,et al.  3D-printing of non-assembly, articulated models , 2012, ACM Trans. Graph..

[36]  Víctor Codocedo,et al.  A semantic approach to concept lattice-based information retrieval , 2014, Annals of Mathematics and Artificial Intelligence.

[37]  Amedeo Napoli,et al.  Revisiting Numerical Pattern Mining with Formal Concept Analysis , 2011, IJCAI.

[38]  Wojciech Matusik,et al.  Chopper: partitioning models into 3D-printable parts , 2012, ACM Trans. Graph..

[39]  Amedeo Napoli,et al.  Computing Similarity Dependencies with Pattern Structures , 2013, CLA.

[40]  Sebastian Rudolph.  On the Succinctness of Closure Operator Representations , 2014, ICFCA.

[41]  Marcel Campen,et al.  Quad Layout Embedding via Aligned Parameterization , 2014, Comput. Graph. Forum.

[42]  Ligang Liu,et al.  Cost-effective printing of 3D objects with skin-frame structures , 2013, ACM Trans. Graph..

[43]  Géraldine Morin,et al.  Symmetry and Fourier Descriptor: A Hybrid Feature For NURBS based B-Rep Models Retrieval , 2014, 3DOR@Eurographics.

[44]  Ioannis Z. Emiris,et al.  Implicitization of curves and (hyper)surfaces using predicted support , 2013, Theor. Comput. Sci..

[45]  Ioannis Z. Emiris,et al.  Sparse implicitization by interpolation: Characterizing non-exactness and an application to computing discriminants , 2013, Comput. Aided Des..

[46]  Johannes Wallner,et al.  Interactive Modeling of Architectural Freeform Structures: Combining Geometry with Fabrication and Statics , 2014, AAG.

[47]  Bernhard Ganter,et al.  Pattern Structures and Their Projections , 2001, ICCS.

[48]  Sergei O. Kuznetsov,et al.  Some decision and counting problems of the Duquenne-Guigues basis of implications , 2008, Discret. Appl. Math..

[49]  Wojciech Matusik,et al.  OpenFab , 2013, ACM Trans. Graph..

[50]  Doug L. James,et al.  Fabricating articulated characters from skinned meshes , 2012, ACM Trans. Graph..

[51]  Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010 , 2010, CIKM.

[52]  Olga Sorkine-Hornung,et al.  Designing unreinforced masonry models , 2013, ACM Trans. Graph..

[53]  Sylvain Lefebvre,et al.  Make it stand , 2013, ACM Trans. Graph..

[54]  Amedeo Napoli,et al.  Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data , 2013, ICFCA.

[55]  Radomír Mech,et al.  Stress relief , 2012, ACM Trans. Graph..

[56]  Lei He,et al.  Mesh denoising via L0 minimization , 2013, ACM Trans. Graph..

[57]  Sergei O. Kuznetsov,et al.  On the Intractability of Computing the Duquenne?Guigues Bas , 2004, J. Univers. Comput. Sci..

[58]  Amedeo Napoli,et al.  Mining gene expression data with pattern structures in formal concept analysis , 2011, Inf. Sci..

[59]  Petko Valtchev,et al.  On the Merge of Factor Canonical Bases , 2008, ICFCA.

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

[61]  Johannes Wallner,et al.  Form-finding with polyhedral meshes made simple , 2014, ACM Trans. Graph..

[62]  Sergei O. Kuznetsov.  On Computing the Size of a Lattice and Related Decision Problems , 2001, Order.