ICCS 2022 : 27th International Conference on Conceptual Structures

The International Conferences on Conceptual Structures (ICCS) focus on
the formal analysis and representation of conceptual knowledge, at the
crossroads of artificial intelligence, human cognition, computational
linguistics, and related areas of computer science and cognitive
science. The ICCS conferences evolved from a series of seven annual
workshops on conceptual graphs, starting with an informal gathering
hosted by John F. Sowa in 1986. Recently, graph-based knowledge
representation and reasoning (KRR) paradigms are getting more and more
attention. With the rise of quasi-autonomous AI, graph-based
representations provide a vehicle for making machine cognition
explicit to its human users.

Submissions are invited on significant, original, and previously
unpublished research on the formal analysis and representation of
conceptual knowledge in artificial intelligence (AI). All papers will
receive mindful and rigorous reviews that will provide authors with
useful critical feedback. The aim of the ICCS 2022 conference is to
build upon its long-standing expertise in graph-based KRR and focus on
providing modelling, formal and application results of graph-based
systems. The conference welcomes contributions that address
graph-based representation and reasoning paradigms (e.g. Bayesian
Networks (BNs), Semantic Networks (SNs), RDF(S), Conceptual Graphs
(CGs), Formal Concept Analysis (FCA), CP-Nets, GAI-Nets, Graph
Databases, Diagrams, Knowledge Graphs, Semantic Web, etc.) from a
modelling, theoretical and application viewpoint.

*Topics*

Topics include but are not limited to:
- Existential and Conceptual Graphs
- Graph-based models for human reasoning
- Social network analysis
- Formal Concept Analysis
- Conceptual knowledge acquisition
- Data and Text mining
- Human and machine reasoning under inconsistency
- Human and machine knowledge representation and uncertainty
- Automated decision-making and argumentation
- Preferences
- Contextual logic
- Ontologies
- Knowledge architecture and management
- Semantic Web, Web of Data, Web 2.0
- Conceptual structures in natural language processing and linguistics
- Metaphoric, cultural or semiotic considerations
- Constraint satisfaction
- Resource allocation and agreement technologies
- Philosophical, neural, and didactic investigations of conceptual, graphical representations

*Submission Information*

We invite scientific papers of up to fourteen pages, short
contributions up to eight pages. Papers must be formatted according to
Springer’s LNCS style guidelines and not exceed the page limit. Papers
will be subject to double-blind peer review, in which the reviewers do
not know the author’s identity, and the submission should be done via
EasyChair (https://easychair.org/conferences/?conf=iccs20220). All
paper submissions will be refereed and authors will have the
opportunity to respond to reviewers’ comments during the rebuttal
phase. Accepted papers will be included in the conference proceedings,
published by Springer in the LNCS/LNAI series. At least one author of
each accepted paper must register for the conference and present the
paper there. Proceedings will be submitted for indexation by DBLP.

*Review Process*

Papers will be subject to double blind peer review in which the
reviewers do not know the author’s identity. In order to make blind
reviewing possible, authors must omit their names and affiliations
from the paper. Also, while the references should not include
unpublished work. When referring to one’s own work, use the third
person rather than the first person. Such identifying information can
be added back to the final camera-ready version of accepted
papers. Similarly, reviewers should not reveal their identities within
the paper reviews. The review process will include the opportunity for
authors to see the reviews of their papers and to respond to technical
questions raised by the reviewers before discussion starts within the
Program Committee. The decision of the Program Committee will be final
and cannot be appealed.