====== SDML ====== //SDML (“strictly declarative modelling language”) has been designed to facilitate flexible multi-agent modelling of organizations. SDML can easily be used to represent either simple or sophisticated agents and the nature of the social relations that exist among them.// É um pessoal da Manchester Metropolitan University num instituto chamado Centre for Policy Modelling. Eles implementaram (faz quase 10 anos) uma Linguagem de Modelagem Declarativa. Fizeram esse framework em Smalltalk, mas tá lá a ideia de uma base de regras... Estão aqui os endereços O tutorial: [[http://cfpm.org/sdml/intro/html/sdml_tut_1.html]] A pagina da linguagem: [[http://cfpm.org/sdml/]] A pagina do CFPM: [[http://cfpm.org/]] \\ ====SDML: A Multi-Agent Language for Organizational Modelling==== |Moss S., Gaylard H, Wallis S., Edmonds B., 1998| Computational and Mathematical Organization Theory| [[http://leg.ufpr.br/~pedro/papers/SDML.pdf|pdf]]| [[http://scholar.google.com.br/scholar?hl=pt-BR&lr=&cites=2827983691137268586|83 citations in Scholar]]| \\ **Abstract:** A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of its functionality. The language is SDML, a strictly declarative modelling language which has object-oriented features and corresponds to a fragment of strongly grounded autoepistemic logic. The virtues of SDML include the ease of building complex models and the facility for representing agents flexibly as models of cognition as well as modularity and code reusability. Two representations of cognitive agents within organizational structures are reported and a [[http://sitemaker.umich.edu/soar/home|Soar]]-to-SDML compiler is described. One of the agent representations is a declarative implementation of a Soar agent taken from the Radar-Soar model of Ye and Carley (1995). The Ye-Carley results are replicated but the declarative SDML implementation is shown to be much less computationally expensive than the more procedural Soar implementation. As a result, it appears that SDML supports more elaborate representations of agent cognition together with more detailed articulation of organizational structure than we have seen in computational organization theory. Moreover, by representing Soar-cognitive agents declaratively within SDML, that implementation of the Ye-Carley specification is necessarily consistent and sound with respect to the formal logic to which SDML corresponds. \\ A rule in SDML has antecedents and consequents. Both antecedents and consequents consist of clauses. A clause consists of a functor and a number of arguments. The type Agent is distinguished from Object in that it has rulebases associated with it. Meta Agents have the ability to write to rulebases as if they were databases, and thus these provide one means of implementing agents which learn. Agents communicate by writing the results of their rule firing to their databases or those of a container and reading the results of another agent’s rule firing from that agent’s database or that of a **shared container**. It is often convenient for agents to share information via the container as this does not require explicit addressing. This is especially so where the structure of the organization may be changing. SDML allows for different accessibility for agents to other agents’ databases: private, public, or intermediate to the defining container. There is also the option of having read only data.