Computational situation theory in the conceptual graph language

Author(s):  
Bikash Chandra Ghosh ◽  
Vilas Wuwongse
Author(s):  
TRU H. CAO

Conceptual graphs and fuzzy logic are two logical formalisms that emphasize the target of natural language, where conceptual graphs provide a structure of formulas close to that of natural language sentences while fuzzy logic provides a methodology for computing with words. This paper proposes fuzzy conceptual graphs as a knowledge representation language that combines the advantages of both the two formalisms for artificial intelligence approaching human expression and reasoning. Firstly, the conceptual graph language is extended with functional relation types for representing functional dependency, and conjunctive types for joining concepts and relations. Then fuzzy conceptual graphs are formulated as a generalization of conceptual graphs where fuzzy types and fuzzy attribute-values are used in place of crisp types and crisp attribute-values. Projection and join as basic operations for reasoning on fuzzy conceptual graphs are defined, taking into account the semantics of fuzzy set-based values.


1995 ◽  
Vol 34 (04) ◽  
pp. 345-351 ◽  
Author(s):  
A. Burgun ◽  
L. P. Seka ◽  
D. Delamarre ◽  
P. Le Beux

Abstract:In medicine, as in other domains, indexing and classification is a natural human task which is used for information retrieval and representation. In the medical field, encoding of patient discharge summaries is still a manual time-consuming task. This paper describes an automated coding system of patient discharge summaries from the field of coronary diseases into the ICD-9-CM classification. The system is developed in the context of the European AIM MENELAS project, a natural-language understanding system which uses the conceptual-graph formalism. Indexing is performed by using a two-step processing scheme; a first recognition stage is implemented by a matching procedure and a secondary selection stage is made according to the coding priorities. We show the general features of the necessary translation of the classification terms in the conceptual-graph model, and for the coding rules compliance. An advantage of the system is to provide an objective evaluation and assessment procedure for natural-language understanding.


Author(s):  
Peter M. Todd ◽  
Gerd Gigerenzer

The study of situations involves asking how people behave in particular environmental settings, often in terms of their individual personality differences. The ecological rationality research program explains people’s behavior in terms of the specific decision-making tools they select and use from their mind’s adaptive toolbox when faced with specific types of environment structure. These two approaches can be integrated to provide a more precise mapping from features of situation structure to decision heuristics used and behavioral outcomes. This chapter presents three examples illustrating research on ecological rationality and its foundations, along with initial directions for incorporating it into an integrated situation theory.


Author(s):  
Matt Baxter ◽  
Simon Polovina ◽  
Wim Laurier ◽  
Mark von Rosing

AbstractEnterprise Architecture (EA) metamodels align an organisation’s business, information and technology resources so that these assets best meet the organisation’s purpose. The Layered EA Development (LEAD) Ontology enhances EA practices by a metamodel with layered metaobjects as its building blocks interconnected by semantic relations. Each metaobject connects to another metaobject by two semantic relations in opposing directions, thus highlighting how each metaobject views other metaobjects from its perspective. While the resulting two directed graphs reveal all the multiple pathways in the metamodel, more desirable would be to have one directed graph that focusses on the dependencies in the pathways. Towards this aim, using CG-FCA (where CG refers to Conceptual Graph and FCA to Formal Concept Analysis) and a LEAD case study, we determine an algorithm that elicits the active as opposed to the passive semantic relations between the metaobjects resulting in one directed graph metamodel. We also identified the general applicability of our algorithm to any metamodel that consists of triples of objects with active and passive relations.


Author(s):  
Ku Ruhana Ku-Mahamud ◽  
Aniza Mohamed Din ◽  
Noraziah Che Pa ◽  
Faudziah Ahmad ◽  
Wan Hussain Wan Ishak ◽  
...  

Focusing on the use of Semantic Network and Conceptual Graph (CG) representations, this paper presents an easy way in understanding concepts discussed in the Holy Quran. Quran is known as the main source of knowledge and has been a major source reference for all types of problems. However understanding the issues and the solution from the Quran is diffi cult due to lack of understanding of Quran literature. Meticulously, the Quran contains much important information related to female. However, this information are scattered and complexly linked. Technically, to extract and present the encapsulated knowledge on female matters in the Quran is a challenging task. Thus, this paper discusses on how to understand and represent the knowledge in an easy way. A total of 18 female terms are identifi ed. Through the terms, the name of surah, verses number and text from the verses are gathered. The texts are then analyzed and clustered into specifi c issues. Result of the analysis that consists of extracted knowledge on female issues is presented in a systematic structure using Semantic Network and CG. The strength and advantages of both approaches are compared, discussed and presented.  


2021 ◽  
Vol 18 (1) ◽  
pp. 1-24
Author(s):  
Andrew Tedder

Situation theory, and channel theory in particular, have been used to provide motivational accounts of the ternary relation semantics of relevant, substructural, and various non-classical logics. Among the constraints imposed by channel-theory, we must posit a certain existence criterion for situations which result from the composites of multiple channels (this is used in modeling information flow). In associative non-classical logics, it is relatively easy to show that a certain such condition is met, but the problem is trickier in non-associative logics. Following Tedder (2017), where it was shown that the conjunction-conditional fragment of the logic B admits the existence of composite channels, I present a generalised ver- sion of the previous argument, appropriate to logics with disjunction, in the neighbourhood ternary relation semantic framework. I close by suggesting that the logic BB+(^I), which falls between Lavers' system BB+ and B+ , satisfies the conditions for the general argument to go through (and prove that it satisfies all but one of those conditions).


Sign in / Sign up

Export Citation Format

Share Document