Emergent Semantics Principles and Issues

Reference

Aberer, Karl; Cudré-Mauroux, Philippe; Ouksel, Aris M.; Catarci, Tiziana; Hacid, Mohand-Saïd; Illarramendi, Arantza; Kashyap, Vipul; Mecella, Massimo; Mena, Eduardo; Neuhold, Erich J.; De Troyer, Olga; Risse, Thomas; Scannapieco, Monica; Saltor, Fèlix; De Santis, Luca; Spaccapietra, Stefano; Staab, Steffen; Studer, Rudi (2004). “Emergent Semantics Principles and Issues.” In Database Systems for Advanced Applications (DASFAA 2004), LNCS 2973, Springer, pp. 25–38.
PDF (original request): academia.edu/download/30719740/DASFAA2004.pdf
Paper page: academia.edu/2746543

Summary

A large-author position paper arguing that the heterogeneity problem of large-scale, decentralised information systems cannot be solved by the classic top-down recipe of designing a single global schema or shared ontology and forcing everyone to commit to it. Over the previous decade information infrastructures had decentralised radically — from a few statically connected central servers to a web of millions of loosely coupled, autonomous information sources — and the Semantic Web promised to extend this to meaningful data exchange. But the sheer number and diversity of sources (formats, models, vocabularies) makes any centrally negotiated agreement infeasible to build and impossible to keep current. The authors propose emergent semantics: semantic interoperability treated not as a precondition imposed in advance but as a self-organising property that arises incrementally and bottom-up from purely local interactions between agents, with no global coordinator.

The conceptual core reframes “meaning” along the lines of semiotics and the social theory of language. Semantics is not an intrinsic property of a symbol but a relation among syntactic structures, the things they denote, and a community of agents that use them; meaning is established and stabilised through communication and use, much as human linguistic conventions emerge from repeated interaction. Concretely, individual sources form local semantic agreements — pairwise schema/ontology mappings, query translations, negotiated correspondences — and a global semantics emerges as the aggregate, statistically consistent fixpoint of these many local agreements. The system is dynamic and self-referential: agreements are continually formed, tested against new interactions, reinforced or revised, so the semantics of the network is an equilibrium that drifts as the population and its data evolve, rather than a fixed artefact.

The paper is programmatic, laying out research issues rather than a finished system. It frames emergent semantics as a distributed, incremental, consensus-finding process and enumerates the hard questions it raises: how to bootstrap initial mappings, how to measure the degree of semantic agreement and detect (in)consistency across a network, how to do query answering and reasoning under the resulting uncertainty, how agreements should evolve and self-heal, and how trust and reputation bear on which agreements to adopt. It situates the idea against prior database integration (global-as-view / local-as-view mediation) and against the Semantic Web’s ontology-centric programme, positioning emergent semantics as the scalable, decentralised alternative for settings where no authority can dictate meaning. The authors draw explicitly on self-organisation and complex-systems thinking — meaning as an emergent macro-property of micro-level interactions.

Key Ideas

Emergent semantics: semantic interoperability as a self-organising, bottom-up phenomenon, not a top-down precondition; global agreement emerges from local interactions without central coordination.
No global ontology: rejects the single-shared-schema/ontology recipe as infeasible at web scale; meaning cannot be legislated for millions of autonomous, heterogeneous sources.
Meaning as relation, not property: semiotic stance — semantics is a relation among symbols, referents, and a community of agents, fixed through use and communication (echoing language convention).
Local agreements → global semantics: pairwise mappings, query translations, and negotiated correspondences accumulate; the network-wide semantics is their aggregate/statistical fixpoint.
Dynamic & self-referential: agreements are continually formed, tested, reinforced, or revised; the global semantics is a drifting equilibrium, not a static artefact.
Consensus as the mechanism: interoperability is a distributed consensus-finding process over interpretations, analogous to how distributed systems reach agreement on state.
Open research agenda: bootstrapping mappings, measuring semantic agreement/consistency, query answering under uncertainty, evolution and self-healing, and the role of trust/reputation.
Complex-systems framing: meaning as an emergent macro-property of micro-level agent interactions; self-organisation as the operative principle.

Connections

The Semantic Web — emergent semantics is the decentralised, bottom-up counter-proposal to Berners-Lee et al.’s ontology-layered, designed-agreement vision; both target web-scale meaning, but disagree on whether agreement is imposed or grown.
Ontologies — the load-bearing layer this paper argues cannot be globally pre-agreed; ontologies become local artifacts to be aligned, not a universal substrate.
Ontology Alignment — local pairwise mappings are exactly the alignment problem; emergent semantics makes alignment the primitive operation rather than an afterthought.
Ontology Change Classification and Survey — the “dynamic, drifting equilibrium” claim is ontology evolution at network scale; agreements must change as sources do.
Language Games for Autonomous Robots — Steels’s semiotic-dynamics view (meaning emerging from repeated grounded interaction) is the direct intellectual cousin; emergent semantics is language games for data sources.
Multi-Agent Cooperation and the Emergence of Natural Language, Emergence of Grounded Compositional Language in Multi-Agent Populations — emergence-of-meaning in agent populations; same “convention from local interaction” mechanism, different substrate (databases vs. learned communication protocols).
Gossip Protocols — Aberer’s P2P/P-Grid lineage; emergent semantics presumes decentralised, peer-to-peer propagation of agreements rather than a registry.
Knowledge and Common Knowledge in a Distributed Environment — reaching shared interpretation across autonomous parties is a common-knowledge / distributed-consensus problem; emergent semantics is consensus over meaning.
Emergent Semantics — the concept hub this paper names and seeds.
Self-Organisation, Semiotics — the two theoretical pillars: self-organisation as mechanism, semiotics as the theory of meaning it adopts.

Conceptual Contribution

The paper’s contribution is a stance inversion: where the Semantic Web programme treats shared meaning as infrastructure to be designed and then deployed, emergent semantics treats it as an equilibrium to be grown from local agreements among autonomous agents. By importing the semiotic claim that meaning is a relation fixed through use — and the complex-systems claim that global order can be an emergent property of local interaction — it reframes semantic interoperability as a distributed consensus process rather than a modelling exercise. For agent communication this matters because it dissolves the precondition that agents must share an ontology before they can interact: instead, shared semantics is a consequence of interaction, negotiated pairwise and stabilised statistically across the population. The unanswered questions it catalogues — measuring agreement, querying under uncertainty, evolving and trusting mappings — define a research programme that bridges databases, the Semantic Web, multi-agent systems, and the emergent-language literature.

Tags

#emergent-semantics #semantic-interoperability #ontologies #semantic-web #self-organization #semiotics #ontology-alignment #peer-to-peer #multi-agent #Aberer #foundational #position-paper

Backlinks

Linked Pages

Semiotics

(page does not exist)

Self-Organisation

The emergence of global structure in a system from local, decentralised interactions without a central controller; a core design principle for scalable and resilient MAS and overlay networks.

In this vault

Emergent Semantics

The view that semantic interoperability across large, decentralised collections of autonomous information sources is a self-organising, bottom-up property rather than a top-down precondition. Instead of legislating a single global schema or shared ontology, meaning is grown: sources form local semantic agreements (pairwise mappings, query translations, negotiated correspondences), and a network-wide semantics emerges as the aggregate, statistically consistent fixpoint of those local interactions. Draws on semiotics (meaning as a relation among symbols, referents, and a community of agents, fixed through use) and complex-systems self-organisation (global order as an emergent macro-property of micro-level interaction). The semantics is dynamic and self-referential — agreements are continually formed, tested, reinforced, or revised — so it is a drifting equilibrium, not a fixed artifact.

In this vault

Knowledge and Common Knowledge in a Distributed Environment

Reference

Halpern, J. Y., & Moses, Y. (1990). “Knowledge and Common Knowledge in a Distributed Environment.” Journal of the ACM, 37(3), 549-587. URL

Summary

Halpern and Moses recast distributed protocol design as knowledge transformation: sending a message changes the knowledge state of the system, and correctness specifications can be stated in terms of what individual processes, groups, or “the system” know at various points. The paper develops a formal epistemic logic for distributed systems with operators K_i (agent i knows), E (everyone knows), and C (common knowledge — everyone knows that everyone knows, to infinite depth).

The central technical result is striking: in a truly asynchronous distributed system, common knowledge is unattainable. The classical “coordinated attack” problem (two generals must attack simultaneously but communicate only via lossy messengers) is unsolvable because simultaneous action requires common knowledge of the time to attack, and no finite message chain ever reaches the fixpoint. The muddy children puzzle — a beloved epistemic set piece walked through in the opening — shows how a public announcement can create common knowledge that sequential private reasoning cannot, illuminating why synchronous broadcast matters.

Because strict common knowledge is unattainable, the paper introduces and characterises weaker variants: eventual common knowledge, ε-common knowledge (bounded delay), timestamped common knowledge, and concurrent common knowledge. Each corresponds to a different system model (synchronous, partially synchronous, etc.) and a different class of solvable coordination tasks. This framework turned “what does a protocol achieve?” into a precise epistemic question and seeded the entire field of Theoretical Aspects of Reasoning about Knowledge (TARK).

Key Ideas

Epistemic hierarchy: distributed knowledge ⊑ someone knows ⊑ everyone knows (E) ⊑ common knowledge (C).
Common knowledge (C): fixpoint E^ω — needed for any simultaneous coordinated action.
Coordinated attack / muddy children: canonical illustrations of how public announcements create C.
Impossibility: in async or even synchronous-with-uncertain-delivery systems, C cannot be attained by message exchange.
Weakenings: ε-C (bounded-time C), eventual C, timestamped C, concurrent C — each aligned with a synchrony assumption.
Protocols as knowledge transformers: specifications are claims about K_i, E, C; message sends are knowledge updates.
Runs-and-systems semantics: each global history is a “run”; agent’s knowledge is the set of runs it cannot distinguish from the actual one.

Connections

Epistemic Logic
Epistemic S5
Knowing What vs Knowing That
The Synthesis of Digital Machines with Provable Epistemic Properties — Rosenschein-Kaelbling operationalise this framework.
Time Clocks and the Ordering of Events in a Distributed System — the “local history” underpinning indistinguishable runs is Lamport’s past-cone.
Impossibility of Distributed Consensus with One Faulty Process — consensus impossibility has an epistemic reading: common knowledge of a decision cannot be attained.
CAP Theorem

Conceptual Contribution

Gossip Protocols

Epidemic information dissemination and aggregation in distributed systems.

Sources

Emergence of Grounded Compositional Language in Multi-Agent Populations

Reference: Igor Mordatch and Pieter Abbeel (2018). AAAI-18. Source file: 11492-13-15020-1-2-20201228.pdf. URL

Summary

Proposes a multi-agent environment and differentiable training procedure in which agents develop an abstract compositional communication protocol purely from the need to coordinate on non-linguistic goals (move-to-location, look-at, etc.) in a 2D world with landmarks. Agents emit streams of discrete symbols (Gumbel-Softmax relaxed) along with physical actions; symbols acquire stable, interpretable meanings corresponding to goal types, landmarks, and agent identities.

The emergent language exhibits syntactic ordering, vocabulary-size regularization via a Dirichlet-process-inspired penalty, and non-verbal strategies (pointing, guiding) when symbols are disabled. The paper is a foundational piece in the modern “emergent communication” literature.

Key Ideas

Communication emerges from cooperative multi-agent RL with shared reward
Gumbel-Softmax makes discrete symbol channels differentiable
Vocabulary-size penalty (DP-style) prevents symbol proliferation and encourages compositionality
Non-verbal channels (gaze, position) substitute when verbal is unavailable
Symbols ground to concepts: GOTO, color, landmark/agent identity

Connections

Conceptual Contribution

Claim: A basic compositional language with coherent vocabulary and rudimentary syntax can emerge from scratch among agents in a physically-grounded, cooperative multi-agent environment, driven purely by the need to coordinate on shared goals.
Mechanism: N agents with private goals share a continuous 2D environment and emit discrete symbol streams; policies are trained end-to-end with differentiable communication (Gumbel-Softmax), shared reward, plus a Dirichlet-process-inspired vocabulary-sparsity penalty and an auxiliary goal-prediction reward. Non-verbal strategies (pointing, gaze) emerge when symbolic channel is unavailable.
Concepts introduced/used: Emergent Communication, Grounded Compositional Language, Symbol Grounding Problem, Compositionality, Gumbel-Softmax, Multi-Agent Reinforcement Learning, Referential Games, Language Games, Non-verbal Communication, Vocabulary Size Penalty, Dirichlet Process
Stance: empirical / computational-simulation
Relates to: Companion to Multi-Agent Cooperation and the Emergence of Natural Language (also referential games but 2-player, image-based). Contrasts with the pre-designed KQML as an Agent Communication Language and FIPA-ACL approaches: here semantics emerge from task pressure rather than being stipulated. Resonates with the emergent-protocol behaviour Agora exhibits in A Scalable Communication Protocol for Networks of LLMs.

Tags

Multi-Agent Cooperation and the Emergence of Natural Language

Multi-Agent Cooperation and the Emergence of (Natural) Language

Reference: Angeliki Lazaridou, Alexander Peysakhovich, and Marco Baroni (2017). ICLR 2017. Source file: 1612.07182v2.pdf. URL

Summary

Introduces a referential-game framework for studying emergent communication: a sender sees a target/distractor image pair and sends a single symbol from a fixed vocabulary; a receiver must identify the target using that symbol. The agents are blank-slate neural networks trained only by communication-success reward. The paper studies whether agents converge, whether the emergent symbols align with human-interpretable semantics, and how to nudge the system toward natural-language-compatible codes.

Two sender architectures (agnostic vs informed) are compared; the informed sender produces richer vocabulary usage. A supplementary supervised image-labelling objective is shown to ground agent symbols to human concepts, making them partially interpretable to crowd-workers.

Key Ideas

Referential games as minimal test-beds for emergent protocols
Informed (feature-aware) sender yields more human-like symbol usage
Symbol purity measured against conceptual (McRae) categories
Mixing self-play with supervised labelling grounds emergent codes to natural language
Foundational for later emergent-communication literature

Connections

Conceptual Contribution

Claim: Two neural-network agents playing a referential game (sender/receiver over image pairs) can develop a symbolic code from scratch; with architectural and supervisory nudges, that code can be made to align with human-interpretable object categories.
Mechanism: Lewis-style signalling game with REINFORCE training; contrast agnostic vs informed sender architectures; analyse symbol-to-category purity; then mix supervised image-labelling with self-play to ground emergent symbols in human vocabulary (AlphaGo-inspired). Crowdsourced evaluation shows humans can guess the correct image 68% of the time from emitted symbols.
Concepts introduced/used: Emergent Communication, Referential Games, Lewis Signalling Games, Language Games, Grounding in Human Language, Symbol Grounding Problem, Cheap Talk, Symbol-Category Purity, REINFORCE, Compositionality
Stance: empirical / deep-learning
Relates to: Companion/precursor to Emergence of Grounded Compositional Language in Multi-Agent Populations (physical grounding, >2 agents). Feeds the emergent-protocol thesis of A Scalable Communication Protocol for Networks of LLMs. Contrasts with stipulated-semantics ACLs (KQML as an Agent Communication Language, FIPA-ACL).

Tags

Language Games for Autonomous Robots

Reference: Steels, L. (2001). IEEE Intelligent Systems, Sept/Oct 2001. Source file: steels01languageGames.pdf. URL

Summary

Steels presents language games as a paradigm for creating grounded, open-ended dialogue between autonomous robots and humans. A language game is a scripted verbal interaction situated in a shared environment that simultaneously exercises perception, conceptualization, verbalization, interpretation, and action. By playing repeated games, agents integrate disparate AI components (vision, speech, planning, learning) into a coherent whole and bootstrap shared vocabulary and meaning without a central designer.

The paper details the guessing game as a canonical example: a speaker picks a topic, conceptualizes a distinguishing feature, verbalizes it, and the listener tries to identify the referent — feedback updates their lexicons’ association scores. Experiments on Sony AIBO and the “Talking Heads” setup show how robots acquire words like color and spatial terms through embodied interaction. Language games thus provide a framework for studying the emergence of grounded communication conventions.

Key Ideas

Language games integrate perception, conceptualization, and action.
Guessing game as a minimal grounded-dialogue protocol.
Shared context + feedback drives lexicon convergence.
Talking Heads experiment: lexicons emerge via population interaction.
Language games tackle integration and grounding jointly.

Connections

Conceptual Contribution

Claim: Grounded, open-ended communication in robots can emerge from repeated situated “language games” that co-exercise perception, conceptualisation, verbalisation and action — with no central designer of the lexicon.
Mechanism: Steels formalises the guessing-game protocol: speaker selects a topic in shared scene, computes a distinguishing category, encodes it as a word; listener decodes, points, and success/failure feeds back to associative lexicon scores. Embodied populations of Sony AIBOs and the Talking Heads platform empirically show lexicon convergence over colour, spatial and proper-name vocabularies, demonstrating that integration of AI sub-systems and semantic grounding are solved jointly rather than separately.
Concepts introduced/used: Language Game, Guessing Game, Grounding, Lexicon Convergence, Talking Heads Experiment, Semiotic Cycle, Emergent Communication
Stance: empirical
Relates to: Provides an embodied-situated counterpart to the decision-theoretic language emergence of Towards Automating the Evolution of Linguistic Competence and the neural-MARL emergence of Emergence of Grounded Compositional Language in Multi-Agent Populations; its feedback-driven convergence contrasts with the top-down protocol stipulation of FIPA-ACL.

Tags

Ontology Change Classification and Survey

Ontology Change: Classification and Survey

Reference: Flouris, Manakanatas, Kondylakis, Plexousakis, Antoniou (2008). The Knowledge Engineering Review, Cambridge University Press. Source file: Ontology_Change_Classification_and_Survey.pdf. URL

Summary

This survey tackles the terminological confusion surrounding ontology change in the Semantic Web era. The authors argue that many overlapping terms — ontology evolution, versioning, merging, mapping, matching, articulation, translation, debugging, integration, morphism — are used inconsistently across the literature, creating a major bottleneck for research. They propose a unifying terminology and taxonomy, fixing precise definitions and identifying the boundaries between ten subfields of ontology change plus ontology alignment.

The paper organizes these subfields into four groups: heterogeneity resolution (mapping/matching/articulation/morphism/translation), modification (evolution, debugging/diagnosis/repair), fusion (integration, merging), and versioning. Each field is characterized by its purpose, inputs, outputs, and properties, and the authors review representative algorithms and systems, including a detailed classification of matching approaches (instance vs. schema, element vs. structure, language vs. constraint, matching cardinality, auxiliary information).

Key Ideas

Ontology change is the generic process of adapting an ontology to a need for change.
Heterogeneity resolution is a prerequisite for any successful ontology change.
Formal pair <S, A> defines an ontology by signature and axioms.
Ten interlinked subfields are identified and disambiguated.
Ontology evolution is closely tied to belief revision.

Connections

Conceptual Contribution

Claim: Research on ontology change is fragmented by inconsistent terminology; a precise, unified taxonomy is needed before the field’s problems can be compared, composed, or solved.
Mechanism: The authors define an ontology formally as a signature–axiom pair <S,A>, then enumerate ten subfields (mapping, matching, morphism, articulation, translation, evolution, debugging, versioning, integration, merging) and characterise each by inputs/outputs/properties. Representative algorithms and systems are then slotted into the taxonomy, with matching approaches classified by dimension (schema vs. instance, element vs. structure, cardinality, auxiliary info).
Concepts introduced/used: Ontology Change, Ontology Evolution, Ontology Mapping, Ontology Merging, Ontology Alignment, Belief Revision, Semantic Web, Heterogeneity Resolution
Stance: survey
Relates to: Provides the vocabulary implicitly assumed by ACL work on shared ontologies (The State of the Art in Agent Communication Languages, Trends in Agent Communication Language) and complements the handbook-level treatment in Handbook On Ontologies. Its belief-revision framing links to epistemic semantics used in Agent-Oriented Programming.

Tags

Ontology Alignment

The subfield of ontology change concerned with computing correspondences (equivalence, subsumption, disjointness) between entities of two ontologies while leaving both intact. Distinguished from mapping (typically directional) and merging (produces a unified ontology).

In this vault

Ontologies

Shared, formal vocabularies for meaning. Essential for agents to understand each other.

Sources

The Semantic Web

Reference

Berners-Lee, Tim; Hendler, James; & Lassila, Ora (2001). “The Semantic Web.” Scientific American 284(5): 34–43, May 17 2001.
PDF: jmvidal.cse.sc.edu/library/berners-lee01a.pdf
Also: scientificamerican.com/article/the-semantic-web
Lassila’s site: lassila.org/publications/2001/SciAm.html
Local: semanticweb2001.pdf

Summary

Berners-Lee, Hendler, and Lassila sketch an extension of the World Wide Web in which content carries machine-processable meaning, enabling software agents to perform non-trivial tasks on behalf of users. The article opens with the now-famous Pete-and-Lucy vignette: Lucy’s agent coordinates medical appointments, cross-references insurance providers, negotiates schedules with Pete’s agent, and replans when a preferred plan is rejected. The authors stress that this does not require HAL-level AI; it requires that web pages embed structured semantics that off-the-shelf tools can author and that agents can consume.

The vision rests on three interlocking commitments. First, meaning is expressed through structured data formats — XML for syntax, RDF for triples (subject–predicate–object with URIs), and ontologies that give classes, properties, and inference rules a shared interpretation. Second, the Web’s decentralisation is preserved: unlike traditional knowledge-representation systems that require a single central vocabulary, the Semantic Web accepts paradoxes and unanswerable questions as the price of scale, and lets ontologies be published, linked, and partially reused. Third, agents are the consumers: they roam from page to page, chain inferences across ontologies, evaluate trust via digital signatures and proofs, and negotiate on behalf of human users. The article walks through examples of rule-based inference, ontology alignment (e.g., reconciling “zip code” across sites), and the architecture of trust (“Oh, yeah?” buttons) that lets an agent verify claims by following proofs.

Throughout, the tone is programmatic. The authors concede that knowledge representation has existed since long before the Web and is “in a state comparable to that of hypertext before the advent of the Web” — useful demos but no global connective tissue. The Semantic Web’s contribution is not new KR theory but linking KR into a single global system, exactly as hypertext was the connective tissue for documents. The payoff is machine-to-machine data integration, delegated tasks, and a qualitative shift in what individual users and organisations can accomplish through agents.

Key Ideas

Machine-processable meaning on the Web: structured data with URI-identified terms, not just rendered documents.
Layered stack: URIs → XML → RDF (triples) → Ontologies (OWL-like) → Logic/Rules → Proof → Trust.
Decentralised knowledge representation: no central ontology; partial agreement, mapping between vocabularies.
Agents as consumers: the reason the Semantic Web matters is that software agents can act on the structured content, including negotiating, scheduling, verifying.
Ontologies provide shared classes, properties, and inference rules; critical for cross-site data integration.
Trust via proofs and digital signatures: an agent should be able to demand the derivation of a claim and check it.
Pete-and-Lucy scenario as the canonical multi-agent, multi-ontology, real-world task.
Hypertext analogy: KR is where hypertext was pre-Web — good ideas, no global connective layer; the Semantic Web is that layer.

Connections

Semantic Web — the cluster topic this paper names.
Ontologies — ontologies are the load-bearing layer of the Semantic Web stack.
Handbook On Ontologies — systematic treatment of the ontology engineering the paper demands.
Ontolingua Portable Ontology Specifications — prior art on shareable ontology specifications that feeds into the Semantic Web plan.
Toward Principles for the Design of Ontologies Used for Knowledge Sharing — Gruber’s principles underlie the Semantic Web’s ontology layer.
A Common Ontology Of ACLs, ACL Design Principles — the ACL literature provides the agent-to-agent communication layer that Pete’s and Lucy’s agents would need.
Multi-Agent Systems, Intelligent Agents Theory and Practice, On Agent-Based Software Engineering — the agent side of the vision; Jennings’s “knowledge-level interaction” is the social counterpart to the Semantic Web’s data-level interoperability.
A Framework for Representing Knowledge — frames, slots, defaults prefigure RDF/OWL class-property structure.
Knowledge Representation — the historical discipline whose ideas the Semantic Web proposes to “link into a single global system”.
Abstract Agent Interfaces — interface-level agreement aligning with ontology-level agreement.