Computational situation theory in the conceptual graph language

Ghosh, Bikash Chandra; Wuwongse, Vilas

doi:10.1007/3-540-61534-2_12

Cited by 3 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The simple CGs which are fully mappable to FOL formulae are called first-order CGs. Additional features such as sets [21,8], contexts [5,6,7,16], and various quantifiers [1] provide higher reasoning capabilities by allowing modal [10], temporal [4,19,20] and fuzzy [1] reasoning systems to be devised based on the CG representation language. First-order CGs are composed of concepts and relation nodes.…”

Section: Modeling Constructs In the Cg Formalismmentioning

confidence: 99%

Conceptual Graphs and Metamodeling

Gerbé

Mineau

Keller

2001

Conceptual Structures: Broadening the Base

View full text Add to dashboard Cite

Abstract.Metamodeling is often identified as a key layer in the development of an information system because it formally defines the modeling primitives that will be used in subsequent modeling activities. We use the Conceptual Graph (CG) theory for illustration purposes. The simplicity of the CG notation and its flexibility to represent metalevel knowledge through the use of contexts makes it a serious contender for the representation of a metamodeling theory. Therefore, this paper presents a CG based metamodeling framework for the modeling of information systems.

show abstract

Section: Modeling Constructs In the Cg Formalismmentioning

confidence: 99%

Conceptual Graphs and Metamodeling

Gerbé

Mineau

Keller

2001

Conceptual Structures: Broadening the Base

View full text Add to dashboard Cite

show abstract

“…Some work on database validation using knowledge representation formalisms shows the obvious advantages of having a formal representation of the application domain [2]. The CG formalism, through its formal semantics [14; 3], its mapping to first-order [18] and higher-order logic [6] provides for the establishment of such validation tools that could be very helpful in modeling a MAS system, as showed above with the modeling and the on-going validation of its interaction protocol. Therefore, for all these reasons we advocate the use of the CG formalism in conjunction with other multi-agent systems (MAS) modeling methodologies such as Agent-UML or MAS-CommonKADS.…”

Section: Resultsmentioning

confidence: 99%

Representing and enforcing interaction protocols in multi-agent systems: an approach based on conceptual graphs

Mineau

IEEE/WIC International Conference on Intelligent Agent Technology, 2003. IAT 2003.

View full text Add to dashboard Cite

For a multi-agent system to work according to its specifications, the individual agents that compose it must abide by the interaction protocol that binds their actions. This interaction protocol delimits what the agents can do, so therefore, their ability to communicate, negotiate, and collaborate. By making some actions conditional to some other actions, it even enforces the control structure of the system. This paper presents a simple representation based on conceptual graphs used to describe an interaction protocol in a declarative way, and shows how subsumption between constraint graphs and asserted graphs can be used to enforce it. Our claim is that a declarative, logic-based, graphical representation of an interaction protocol will help the syst em designer to describe and validate it, to enforce it, and subsequently to update it, therefore improving the development cycle of the system, more particularly its design phase.

show abstract

A Simulation of Co-identity with Rules in Simple and Nested Graphs

Baget

1999

Conceptual Structures: Standards and Practices

View full text Add to dashboard Cite

Computational situation theory in the conceptual graph language

Cited by 3 publications

References 5 publications

Conceptual Graphs and Metamodeling

Conceptual Graphs and Metamodeling

Representing and enforcing interaction protocols in multi-agent systems: an approach based on conceptual graphs

A Simulation of Co-identity with Rules in Simple and Nested Graphs

Contact Info

Product

Resources

About