KEOD is part of IC3K, the 13th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management. Registration to KEOD allows free access to all other IC3K conferences.
IC3K 2021 will be held in conjunction with WEBIST 2021, IN4PL 2021 and IJCCI 2021.
Registration to IC3K allows free access to the WEBIST, IN4PL and IJCCI conferences (as a non-speaker).
Knowledge Engineering (KE) refers to all technical, scientific and social aspects involved in building, maintaining and using knowledge-based systems. KE is a multidisciplinary field, bringing in concepts and methods from several computer science domains such as artificial intelligence, databases, expert systems, decision support systems and information systems. From the software development point of view, KE uses principles that are strongly related to software engineering. KE is also related to logic (both in mathematics and philosophy domains) and also strongly related with cognitive and social sciences and socio-cognitive engineering, where knowledge is considered to be produced by humans and structured according to our understanding of how human reasoning and logic works. Currently, KE is mostly related with the construction of shared conceptual frameworks, often designated as ontologies, thus the relevance given to this term in our conference.
Joaquim Filipe, Polytechnic Institute of Setubal / INSTICC, Portugal
David Aveiro, Exact Sciences and Engineering Centre, University of Madeira, NOVA-LINCS and ARDITI, PortugalJan Dietz, Computer Science, Delft University of Technology, Netherlands
Eric Yu, University of Toronto, CanadaBhavani Thuraisingham, Computer Science, University of Texas at Dallas, United StatesJan Mendling, Humboldt-Universität zu Berlin, GermanyDeborah L. McGuinness, Rensselaer Polytechnic Institute, United States
Publications:
It is planned to publish a short list of revised and
extended versions of presented papers with
Springer in a CCIS Series book
Proceedings will be submitted for evaluation for indexing by: