November 2021 - SIPTA News - lists.sipta.org

[SIPTA] FoIKS 2022 first call for papers
by Ivan José Varzinczak Jan. 4, 2022

Jan. 4, 2022

* Apologies if you receive multiple copies of this call * ========================================================= Call for Participation FoIKS 2022: 12th International Symposium on Foundations of Information and Knowledge Systems University of Helsinki, Finland, 20-23 June 2022 Conference website: https://foiks2022.github.io Submission link: https://easychair.org/conferences/?conf=foiks2022 Abstract submission deadline: 4 February 2022 Paper submission deadline: 11 February 2022 Notification: 11 April 2022 ========================================================= The FoIKS symposia provide a biennial forum for presenting and discussing theoretical and applied research on information and knowledge systems. The goal is to bring together researchers with an interest in this subject, share research experiences, promote collaboration, and identify new issues and directions for future research. FoIKS 2022 solicits original contributions (as well as extensions of previously published contributions) dealing with any foundational aspect of information and knowledge systems. This includes submissions that apply ideas, theories or methods from specific disciplines to information and knowledge systems. Examples of such disciplines are discrete mathematics, logic and algebra, model theory, information theory, complexity theory, algorithmics and computation, statistics, and optimisation, among, of course, many others. The FoIKS symposia are a forum for intensive discussions. Speakers will be given sufficient time to present their ideas and results within the larger context of their research. Furthermore, participants will be asked to prepare a first response to another contribution in order to initiate discussion. *** Suggested topics The suggested topics include, but are not limited to: * Database design: formal models, dependencies and independencies * Big data: models for data in the Cloud, programming languages for big data, query processing * Dynamics of information: models of transactions, concurrency control, updates, consistency preservation, belief revision * Information fusion: heterogeneity, views, schema dominance, multiple source information merging, reasoning under inconsistency * Integrity and constraint management: verification, validation, consistent query answering, information cleaning * Intelligent agents: multi-agent systems, autonomous agents, foundations of software agents, cooperative agents, formal models of interactions, negotiations and dialogue, logical models of emotions * Knowledge discovery and information retrieval: machine learning, data mining, formal concept analysis and association rules, text mining, information extraction * Knowledge representation, reasoning and planning: non-monotonic formalisms, probabilistic and non-probabilistic models of uncertainty, graphical models and independence, similarity-based reasoning, preference modelling and handling, computational models of argument, argumentation systems * Logics in databases and AI: classical and non-classical logics, logic programming, description logics, spatial and temporal logics, probability logic, fuzzy logic * Mathematical foundations: discrete structures and algorithms, graphs, grammars, automata, abstract machines, finite model theory, information theory, coding theory, complexity theory, randomness * Security in information and knowledge systems: identity thee, privacy, trust, intrusion detection, access control, inference control, secure Web services, secure Semantic Web, risk management * Semi-structured data and XML: data modelling, data processing, data compression, data exchange * Social computing: collective intelligence and self-organising knowledge, collaborative filtering, computational social choice, Boolean games, coalition formation, reputation systems * The Semantic Web and knowledge management: languages, ontologies, agents, adaption, intelligent algorithms, ontology-based data access * The WWW: models of Web databases, Web dynamics, Web services, Web transactions and negotiations, social networks, Web mining *** Submission Guidelines For long papers, the suggested number of pages is 16, and the maximum number of pages is 18. For short papers, the maximum number of pages is 10. All papers must be original and not simultaneously submitted to another journal or conference. Papers must be typeset using the Springer LaTeX2e style llncs for Lecture Notes in Computer Science. Submissions that deviate substantially from these guidelines may be rejected without review. Initial submissions must be in PDF format, but authors should keep in mind that the LaTeX2e source must be submitted for the final versions of accepted papers. Submissions in alternate formats, such as Microsoft Word, cannot be accepted for either initial or final versions. The submissions will be judged for scientific quality and for suitability as a basis for broader discussion. Submission is via the EasyChair link https://easychair.org/conferences/?conf=foiks2022 *** Important Dates Abstract submission deadline (long and short papers): 4 February 2022 Paper submission deadline (long and short papers): 11 February 2022 Author notification: 11 April 2022 Camera-ready paper due: 6 May 2022 FoIKS 2022 Symposium: 20-23 June 2022 *** Program Committee See https://foiks2022.github.io *** Program Chairs Elena Ravve, SE Department, Ort Braude College, Israel Ivan Varzinczak, CRIL, Univ. Artois & CNRS, France *** Local Organisation Chairs Matti Järvisalo, University of Helsinki, Finland Juha Kontinen, University of Helsinki, Finland *** Invited Speakers TBA *** Publication The proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science. After the symposium, authors of selected papers will be invited to submit extended journal versions of their papers for a FoIKS 2022 special issue of the Annals of Mathematics and Artificial Intelligence or another journal. Exact details will be provided on the conference website in due time. *** Venue The conference will be held at the University of Helsinki. Further information on the venue will be provided in due time. *** Further Information Please visit the conference website (https://foiks2022.github.io) for further information and regular updates. *** Contact All enquiries should be emailed to foiks2022 (AT) easychair.org -- Ivan Varzinczak - https://www.ijv.ovh CRIL, Université d'Artois & CNRS, France

1 2

[SIPTA] Re: BELIEF 2022 (Call For Participation)
by Kreinovich Nov. 23, 2021

Nov. 23, 2021

1 0

[SIPTA] BELIEF 2022 (Call For Participation)
by Kreinovich Nov. 23, 2021

Nov. 23, 2021

1 0

[SIPTA] Call for papers: special session at IPMU'22 on interval uncertainty
by Kreinovich Nov. 22, 2021

Nov. 22, 2021

1 0

[SIPTA] Possible feedbacks on graphical model package (including credal networks)?
by Sébastien Destercke Nov. 22, 2021

Nov. 22, 2021

Dear Siptians, Some time ago, we (mainly Pierre-Henri Wuillemin and Matthieu Hourbrack) added some credal network possibilities to AGRUM (https://agrum.gitlab.io/) a general package to work with graph-based models that is quite successful (~150.000 downloads last year). In his last survey (preparing an upcoming user day), Pierre-Henri was happily surprised to see that credal networks was one of the most used feature by users. He therefore wonders if anyone from the community was using it, or had useful feedbacks to provide. Just let me or Pierre-Henri know if this is the case, and if not you can always give AGRUM a try to put a little zest in your day! Cheers Sébastien -- ==================================== Sebastien Destercke, Ph. D. CNRS researcher in computer science. Université de Technologie de Compiegne U.M.R. C.N.R.S. 7253 Heudiasyc Avenue de Landshut F-60205 Compiegne Cedex FRANCE Tel: +33 (0)3 44 23 79 85 Fax: +33 (0)3 44 23 44 77 ====================================

1 0

[SIPTA] CFP Special Session on Machine Learning for Partially Labeled Data, IPMU 2022
by LUCIANO SANCHEZ RAMOS Nov. 17, 2021

Nov. 17, 2021

1 0

[SIPTA] FW: FSTA 2022 - Abstract Submission Deadline Extended
by Kreinovich Nov. 14, 2021

Nov. 14, 2021

1 0

[SIPTA] IPMU 2022 - Call for papers and special sessions
by Davide Elio Ciucci Nov. 8, 2021

Nov. 8, 2021

1 0

[SIPTA] Position opportunity: CNRS applications to open soon
by Sébastien Destercke Nov. 5, 2021

Nov. 5, 2021

Dear colleagues, This is just a message to advertise that, as every year, the CNRS will soon consider applications to become a CNRS permanent researcher, usually with an application deadline around the beginning of january. The application process is competitive, with positions offering a lot of freedom in terms of research, and not coming with any teaching duties (although some can be taken). Speaking french is also optional (but helps in every day life). Applicants are required to provide a research statement of their past activities as well as a research project, and can apply to any CNRS-related laboratory in France (UMR CNRS). There are a number of such laboratories/team in which some researchers focus on uncertainty modelling with an imprecise/ambiguity component, including teams focusing on computer science (CID in Heudiasyc, CRIL, ADRIA in IRIT), economy (GREGHEC at HEC Paris), cognitive psychology (L.P.C. Aix-Marseille Université), and probably others I do not know. While announcements about this year application process have not been done yet, prospective/interested applicants should already contact laboratories they would like to join, in order to prepare the applications. Information regarding last year process can be found here: https://www.dgdr.cnrs.fr/drhchercheurs/concoursch/default-en.htm In case you are interested and need more information, just let me know. Best wishes Sébastien -- ==================================== Sebastien Destercke, Ph. D. CNRS researcher in computer science. Université de Technologie de Compiegne U.M.R. C.N.R.S. 7253 Heudiasyc Avenue de Landshut F-60205 Compiegne Cedex FRANCE Tel: +33 (0)3 44 23 79 85 Fax: +33 (0)3 44 23 44 77 ====================================

1 0