Show simple item record

dc.contributor.authorShakarian, Paulo
dc.contributor.authorSimari, Gerardo I.
dc.contributor.authorSchroeder, Robert
dc.date19 Jan 2013
dc.date.accessioned2013-08-28T22:27:07Z
dc.date.available2013-08-28T22:27:07Z
dc.date.issued2013
dc.identifier.urihttp://hdl.handle.net/10945/35457
dc.description.abstractThe modeling of cascade processes in multi-agent systems in the form of complex networks has in recent years become an important topic of study due to its many applications: the adoption of commercial products, spread of disease, the diffusion of an idea, etc. In this paper, we begin by identifying a desiderata of seven properties that a framework for modeling such processes should satisfy: the ability to represent attributes of both nodes and edges, an explicit representation of time, the ability to represent non-Markovian temporal relationships, representation of uncertain information, the ability to represent competing cascades, allowance of non-monotonic diffusion, and computational tractability. We then present the MANCaLog language, a formalism based on logic programming that satisfies all these desiderata, and focus on algorithms for finding minimal models (from which the outcome of cascades can be obtained) as well as how this formalism can be applied in real world scenarios. We are not aware of any other formalism in the literature that meets all of the above requirements.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleMANCaLog: A Logic for Multi-Attribute Network Cascades (Technical Report)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record