Metraipolis › archive › dc_0c53d8ea613c

Concurrent MetateM — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Concurrent_MetateM
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-05T23:22:12.729Z
SHA-256 of the archived text: 582e1c5dd2b5dfda746a93dab57e69baf426ea3a2ec02977861ddd79dc5a8289
Stable URL of this page: https://metraipolis.com/documento/dc_0c53d8ea613c

How to cite

Concurrent MetateM — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Concurrent_MetateM (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0c53d8ea613c (Metraipolis archive dc_0c53d8ea613c, sha256 582e1c5dd2b5dfda746a93dab57e69baf426ea3a2ec02977861ddd79dc5a8289)

BibTeX

@misc{dc0c53d8ea613c,
  title = {Concurrent MetateM — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Concurrent_MetateM},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0c53d8ea613c; sha256 582e1c5dd2b5dfda746a93dab57e69baf426ea3a2ec02977861ddd79dc5a8289},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Concurrent_MetateM. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Concurrent MetateM is a multi-agent language in which each agent is programmed using a set of (augmented) temporal logic specifications of the behaviour it should exhibit. These specifications are executed directly to generate the behaviour of the agent. As a result, there is no risk of invalidating the logic as with systems where logical specification must first be translated to a lower-level implementation. MetateM is motivated by the separated normal form, where any formula in linear temporal logic can be rewritten as finitely many formulas of the form "past implies future". Execution proceeds by a process of continually matching rules against a history, and firing those rules when antecedents are satisfied. Any instantiated future-time consequents become commitments which must subsequently be satisfied, iteratively generating a model for the formula made up of the program rules.

Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; categoria «Artificial intelligence»).
Fonte: Wikipedia in inglese, voce «Concurrent MetateM» — https://en.wikipedia.org/wiki/Concurrent_MetateM
Wikidata Q5159101 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5159101
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Concurrent_MetateM?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1373676965, consultata il 2026-10-05T23:06:22.777Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a5615a9d3dcd2327187edf43c004a206840e0c6a375c39588e4699ccd837b5b5