• Journal of the International Relations & Interdisciplinary Education
• /
• v.1 no.1
• /
• pp.61-79
• /
• 2021

In order to implement an artificial intelligence lawyer, this study looked at how to structure legal principles, and then gave specific examples of how structured legal principles can be expressed in predicate logic. While previous studies suggested a method of introducing predicate logic for the reasoning engine of artificial intelligence lawyers, this study focused on the method of expressing legal principles with predicate logic based on the structural appearance of legal principles. Jurisprudence was limited to the content of articles and precedents, and the vertical hierarchy leading to 'law facts - legal requirements - legal effect' and the horizontal hierarchy leading to 'legal effect - defense - defense' were examined. In addition, legal facts were classified and explained that most of the legal facts can be usually expressed in unary or binary predicates. In future research, we plan to program the legal principle expressed in predicate logic and realize an inference engine for artificial intelligence lawyers.

• Journal of Intelligence and Information Systems
• /
• v.24 no.2
• /
• pp.171-193
• /
• 2018

LOD(Linked Open Data) cloud is a practical implementation of semantic web. We suggested a new method that provides identity links conveniently in LOD cloud. It also allows changes in LOD to be reflected to searching results without any omissions. LOD provides detail descriptions of entities to public in RDF triple form. RDF triple is composed of subject, predicates, and objects and presents detail description for an entity. Links in LOD cloud, named identity links, are realized by asserting entities of different RDF triples to be identical. Currently, the identity link is provided with creating a link triple explicitly in which associates its subject and object with source and target entities. Link triples are appended to LOD. With identity links, a knowledge achieves from an LOD can be expanded with different knowledge from different LODs. The goal of LOD cloud is providing opportunity of knowledge expansion to users. Appending link triples to LOD, however, has serious difficulties in discovering identity links between entities one by one notwithstanding the enormous scale of LOD. Newly added entities cannot be reflected to searching results until identity links heading for them are serialized and published to LOD cloud. Instead of creating enormous identity links, we propose LOD to prepare its own link policy. The link policy specifies a set of target LODs to link and constraints necessary to discover identity links to entities on target LODs. On searching, it becomes possible to access newly added entities and reflect them to searching results without any omissions by referencing the link policies. Link policy specifies a set of predicate pairs for discovering identity between associated entities in source and target LODs. For the link policy specification, we have suggested a set of vocabularies that conform to RDFS and OWL. Identity between entities is evaluated in accordance with a similarity of the source and the target entities' objects which have been associated with the predicates' pair in the link policy. We implemented a system "Change Acceptable In-Depth Searching System(CAIDS)". With CAIDS, user's searching request starts from depth_0 LOD, i.e. surface searching. Referencing the link policies of LODs, CAIDS proceeds in-depth searching, next LODs of next depths. To supplement identity links derived from the link policies, CAIDS uses explicit link triples as well. Following the identity links, CAIDS's in-depth searching progresses. Content of an entity obtained from depth_0 LOD expands with the contents of entities of other LODs which have been discovered to be identical to depth_0 LOD entity. Expanding content of depth_0 LOD entity without user's cognition of such other LODs is the implementation of knowledge expansion. It is the goal of LOD cloud. The more identity links in LOD cloud, the wider content expansions in LOD cloud. We have suggested a new way to create identity links abundantly and supply them to LOD cloud. Experiments on CAIDS performed against DBpedia LODs of Korea, France, Italy, Spain, and Portugal. They present that CAIDS provides appropriate expansion ratio and inclusion ratio as long as degree of similarity between source and target objects is 0.8 ~ 0.9. Expansion ratio, for each depth, depicts the ratio of the entities discovered at the depth to the entities of depth_0 LOD. For each depth, inclusion ratio illustrates the ratio of the entities discovered only with explicit links to the entities discovered only with link policies. In cases of similarity degrees with under 0.8, expansion becomes excessive and thus contents become distorted. Similarity degree of 0.8 ~ 0.9 provides appropriate amount of RDF triples searched as well. Experiments have evaluated confidence degree of contents which have been expanded in accordance with in-depth searching. Confidence degree of content is directly coupled with identity ratio of an entity, which means the degree of identity to the entity of depth_0 LOD. Identity ratio of an entity is obtained by multiplying source LOD's confidence and source entity's identity ratio. By tracing the identity links in advance, LOD's confidence is evaluated in accordance with the amount of identity links incoming to the entities in the LOD. While evaluating the identity ratio, concept of identity agreement, which means that multiple identity links head to a common entity, has been considered. With the identity agreement concept, experimental results present that identity ratio decreases as depth deepens, but rebounds as the depth deepens more. For each entity, as the number of identity links increases, identity ratio rebounds early and reaches at 1 finally. We found out that more than 8 identity links for each entity would lead users to give their confidence to the contents expanded. Link policy based in-depth searching method, we proposed, is expected to contribute to abundant identity links provisions to LOD cloud.

• The KIPS Transactions:PartB
• /
• v.18B no.6
• /
• pp.405-414
• /
• 2011

Korean grammar checkers typically detect context-dependent errors by employing heuristic rules that are manually formulated by a language expert. These rules are appended each time a new error pattern is detected. However, such grammar checkers are not consistent. In order to resolve this shortcoming, we propose new method for generalizing error decision rules to detect the above errors. For this purpose, we use an existing thesaurus KorLex, which is the Korean version of Princeton WordNet. KorLex has hierarchical word senses for nouns, but does not contain any information about the relationships between cases in a sentence. Through the Tree Cut Model and the MDL(minimum description length) model based on information theory, we extract noun classes from KorLex and generalize error decision rules from these noun classes. In order to verify the accuracy of the new method in an experiment, we extracted nouns used as an object of the four predicates usually confused from a large corpus, and subsequently extracted noun classes from these nouns. We found that the number of error decision rules generalized from these noun classes has decreased to about 64.8%. In conclusion, the precision of our grammar checker exceeds that of conventional ones by 6.2%.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.1-23
• /
• 2011

The contextual subjective well-being (SWB) of context-aware system users can be very helpful in recommending relevant mental health services, especially for those who struggle with mental illness due to a metabolic syndrome or melancholia. Self-surveying measuring or auto-sensing methods have been suggested to monitor users' SWB. However, self-surveying measuring method is not inappropriate for a context-aware service due to requesting personal data in a manual and hence obtrusive manner. Moreover, auto-sensing methods still suffer from accuracy problem to be applied in mental health services. Hence, the purpose of this paper is to propose a contextual SWB estimation method to estimate the user's mental health in unobtrusive and accurate manners. This method is timely in that it acquires context data from the user's literal responses, which expose their temporal feeling. In particular, we developed a measuring method based on exposed feeling verbs and degree adverbs in chat and other text-based communications which show anger or negative feelings. Based on the proposed contextual SWB degree estimation method, we developed an idea of well-being life care recommendation. From the experiment with actual drivers, we demonstrated that the proposed method accurately estimate the user's degree of negative feelings even though it does not require a self-survey.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.259-266
• /
• 2005

Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.

• Journal of Science Education
• /
• v.38 no.2
• /
• pp.344-355
• /
• 2014

The 2009 revised curriculum emphasizes science writing as a way to foster scientific thinking, creative thinking and communicative abilities. This research attempted to find out the aspects of science writing in science textbooks by analyzing seven versions of the 2009 revised science textbooks. The results of the analysis are as follows. First, it was found that the proportion of science writing pages is small and the amount of science writing differs a lot depending on the kind of textbook. Also, science writing is generally located in the wrap-up part of each unit, and the amount and the number of science writing vary substantially from unit to unit depending on the textbook. Second, it was found that 'scientific knowledge-explanation' statements have the largest proportion and 'STS-assertion' statements have the second largest proportion in terms of topics and styles of science writing in science textbooks. Some 'scientific knowledge-explanation' statements are not appropriate to foster scientific ability because they evaluate reading comprehension of the suggested passage as nonliterary writing, not the writing itself as a method to learn science. Third, it was found that there are many predicates that do not indicate a clear purpose of the science writing contained in science textbooks.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.219-230
• /
• 2014

An analysis of dependency relation is a job that determines the governor and the dependent between words in sentence. The dependency relation of predicate is established by patterns and selectional restriction of subcategorization of the predicate. This paper proposes a method of analysis of Korean dependency relation using homograph predicate disambiguated in morphology analysis phase. The disambiguated homograph predicates has each different pattern. Especially reusing a stage transition training dictionary used during tagging POS and homograph, we propose a method of fixing the dependency relation of {noun+postposition, predicate}, and we analyze the accuracy and an effect of homograph for analysis of dependency relation. We used the Sejong Phrase Structured Corpus for experiment. We transformed the phrase structured corpus to dependency relation structure and tagged homograph. From the experiment, the accuracy of dependency relation by disambiguating homograph is 80.38%, the accuracy is increased by 0.42% compared with one of undisambiguated homograph. The Z-values in statistical hypothesis testing with significance level 1% is ${\mid}Z{\mid}=4.63{\geq}z_{0.01}=2.33$. So we can conclude that the homograph affects on analysis of dependency relation, and the stage transition training dictionary used in tagging POS and homograph affects 7.14% on the accuracy of dependency relation.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.3
• /
• pp.141-148
• /
• 2022

Recently, reinforcement learning combined with deep neural network technology has achieved remarkable success in various fields such as board games such as Go and chess, computer games such as Atari and StartCraft, and robot object manipulation tasks. However, such deep reinforcement learning describes states, actions, and policies in vector representation. Therefore, the existing deep reinforcement learning has some limitations in generality and interpretability of the learned policy, and it is difficult to effectively incorporate domain knowledge into policy learning. On the other hand, dNL-RRL, a new relational reinforcement learning framework proposed to solve these problems, uses a kind of vector representation for sensor input data and lower-level motion control as in the existing deep reinforcement learning. However, for states, actions, and learned policies, It uses a relational representation with logic predicates and rules. In this paper, we present dNL-RRL-based policy learning for transportation mobile robots in a manufacturing environment. In particular, this study proposes a effective method to utilize the prior domain knowledge of human experts to improve the efficiency of relational reinforcement learning. Through various experiments, we demonstrate the performance improvement of the relational reinforcement learning by using domain knowledge as proposed in this paper.

• Journal of The Korean Association For Science Education
• /
• v.44 no.2
• /
• pp.219-229
• /
• 2024

The purpose of this study is to analyze the concerns and difficulties encountered by authors involved in the development of integrated science textbooks. Specifically, it focuses on their experiences with understanding and implementing the 2022 revised science curriculum. We collected 89 opinions from textbook authors and categorized them into several key areas: understanding the terminology and descriptors provided in the curriculum, structuring learning content, inquiries and activities, and the depth and scope of learning content. The analysis revealed that the most difficulty encountered by the textbook authors was in defining the level and scope of learning content. Many also expressed concerns and difficulties related to the ambiguity of terms and predicates. In terms of the composition of learning content, difficulties were identified in concerning the repetitive descriptions of achievement standards and the discrepancy between the arrangement of achievement standards and the flow of learning. Regarding inquiries and activities, there were experiments presented that were difficult to experience or actually implement, along with limitations in activity composition due to the need to optimize learning volume. Given the importance of high-quality textbooks for effective science education at the national level, it is crucial to establish effective communication channels between curriculum developers and textbook authors. Additionally, a robust support system for textbook development should be established.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.452-472
• /
• 2005

We propose XIR-Branching, a novel method for processing partial match queries on heterogeneous XML documents using information retrieval(IR) techniques and novel instance join techniques. A partial match query is defined as the one having the descendent-or-self axis '//' in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR-Branching is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Branching has its basis on the conventional schema-level methods using relational tables(e.g., XRel, XParent, XIR-Linear[21]) and significantly improves their efficiency and scalability using two techniques: an inverted index technique and a novel prefix match join. The former supports linear path expressions as the method used in XIR-Linear[21]. The latter supports branching path expressions, and allows for finding the result nodes more efficiently than containment joins used in the conventional methods. XIR-Linear shows the efficiency for linear path expressions, but does not handle branching path expressions. However, we have to handle branching path expressions for querying more in detail and general. The paper presents a novel method for handling branching path expressions. XIR-Branching reduces a candidate set for a query as a schema-level method and then, efficiently finds a final result set by using a novel prefix match join as an instance-level method. We compare the efficiency and scalability of XIR-Branching with those of XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Branching is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions, and by several factors for branching path expressions.