Exploring naturalistic conceptions of ‘a moral person’ for Koreans

textEducational PsychologyIn the field of moral psychology, cognitive functioning has long been the main focus of studies. Many researchers have been interested in moral reasoning ability, its developmental paths, and the process of moral judgment or decision making. Relatively recently, some moral psychologists started questioning whether people who are not theorists, researchers, or educators in morality also put as much emphasis on the cognitive functions as the core of morality. According to the literature, laypeople found to include cognitive aspects as one component of morality, and they also emphasize moral characters and virtues as other elements. In addition, laypeople frequently consider characteristics of ‘a moral person’ when they are asked to think about morality. These findings have activated research on naturalistic conceptions of morality and moral exemplars. However, few studies have examined how laypeople from different cultures other than the United States and Canada conceptualize morality. The purpose of this study was to explore naturalistic conceptions of ‘a moral person’ and to develop a theoretical model of moral exemplars for Koreans based on the gathered conceptions. Twenty two Koreans participated in in-depth, semi-structured, open-ended interviews. A grounded theory approach was used to conduct interviews, analyze data, and achieve the research goals. Korean laypeople’s conceptions included behaviors, personality traits, and psychological functions of ‘a moral person’ for them. In those behaviors and personality traits, both interpersonal (e.g., helping others or caring) and intrapersonal (e.g., living with integrity or being principled) characteristics were found together. Koreans conceptualize a person as moral when he or she tends to behave morally as an outer revelation of inner morality, personality traits. Using psychological functions (e.g., perspective taking, being compassionate, or keeping social face) appeared to promote the emergence of a moral behavior or make the behavior extraordinary. Finally, Koreans found to think of a person as moral who does moral behaviors even in challenging situations, assuming that his or her moral personality traits are strongly associated with the behaviors. In addition, Koreans tend to more emphasize interpersonal (i.e., other-oriented or community-based) aspects of morality than intrapersonal (i.e., self-centered or individual-based) components. These findings were summarized that ‘a moral person’ for Koreans is a person who has ‘moral heart’ and lives ‘in harmony with others.’Educational Psycholog

Fuzzy Cognitive Maps and Neutrosophic Cognitive Maps

As extension of Fuzzy Cognitive Maps are now introduced the Neutrosophic Cognitive Map

Semantic Web Services Provisioning

Semantic Web Services constitute an important research area, where vari ous underlying frameworks, such as WSMO and OWL-S, define Semantic Web ontologies to describe Web services, so they can be automatically discovered, composed, and invoked. Service discovery has been traditionally interpreted as a functional filter in current Semantic Web Services frameworks, frequently performed by Description Logics reasoners. However, semantic provisioning has to be performed taking Quality-of-Service (QOS) into account, defining user preferences that enable QOS-aware Semantic Web Service selection. Nowadays, the research focus is actually on QOS-aware processes, so cur rent proposals are developing the field by providing QOS support to semantic provisioning, especially in selection processes. These processes lead to opti mization problems, where the best service among a set of services has to be selected, so Description Logics cannot be used in this context. Furthermore, user preferences has to be semantically defined so they can be used within selection processes. There are several proposals that extend Semantic Web Services frameworks allowing QOS-aware semantic provisioning. However, proposed selection techniques are very coupled with their proposed extensions, most of them being implemented ad hoc. Thus, there is a semantic gap between functional descriptions (usually using WSMO or OWL-S) and user preferences, which are specific for each proposal, using different ontologies or even non-semantic de scriptions, and depending on its corresponding ad hoc selection technique. In this report, we give an overview of most important Semantic Web Ser vices frameworks, showing a comparison between them. Then, a thorough analysis of state-of-the art proposals on QOS-aware semantic provisioning and user preferences descriptions is presented, discussing about their applicabil ity, advantages, and defects. Results from this analysis motivate our research work, which has been already materialized in two early contributions.Los servicios web semánticos constituyen un importante campo de inves tigación, en el cual distintos frameworks, como por ejemplo WSMO y OWL-S, definen ontologías de la web semántica para describir servicios web, de for ma que estos puedan ser descubiertos, compuestos e invocados de manera automática. El descubrimiento de servicios ha sido interpretado tradicional mente como un filtro funcional en los frameworks actuales de servicios web semánticos, usando para ello razonadores de lógica descriptiva. Sin embargo, las tareas de aprovisionamiento semántico deberían tener en cuenta la calidad del servicio, definiendo para ello preferencias de usuario de manera que sea posible realizar una selección de servicios web semánticos sensible a la cali dad. Actualmente, el foco de la investigación está en procesos sensibles a la ca lidad, por lo que las propuestas actuales están trabajando en este campo intro duciendo el soporte adecuado a la calidad del servicio dentro del aprovisio namiento semántico, y principalmente en las tareas de selección. Estas tareas desembocan en problemas de optimización, donde el mejor servicio de entre un concjunto debe ser seleccionado, por lo que las lógicas descriptivas no pue den ser usadas en este contexto. Además, las preferencias de usuario deben ser definidas semánticamente, de forma que puedan ser usadas en las tareas de selección. Existen bastantes propuestas que extienden los frameworks de servicios web semánticos para habilitar el aprovisionamiento sensible a la calidad. Sin embargo, las técnicas de selección propuestas están altamente acopladas con dichas extensiones, donde la mayoría de ellas implementan algoritmos ad hoc. Por tanto, existe un salto semántico entre las descripciones funcionales (nor malmente usando WSMO o OWL-S) y las preferencias de usuario, las cuales son definidas específicamente por cada propuesta, usando ontologías distin tas o incluso descripciones no semánticas que dependen de la correspondiente técnica de selección ad hoc

The 1992 Goddard Conference on Space Applications of Artificial Intelligence

The purpose of this conference is to provide a forum in which current research and development directed at space applications of artificial intelligence can be presented and discussed. The papers fall into the following areas: planning and scheduling, control, fault monitoring/diagnosis and recovery, information management, tools, neural networks, and miscellaneous applications

A Lightweight Defeasible Description Logic in Depth: Quantification in Rational Reasoning and Beyond

Description Logics (DLs) are increasingly successful knowledge representation formalisms, useful for any application requiring implicit derivation of knowledge from explicitly known facts. A prominent example domain benefiting from these formalisms since the 1990s is the biomedical field. This area contributes an intangible amount of facts and relations between low- and high-level concepts such as the constitution of cells or interactions between studied illnesses, their symptoms and remedies. DLs are well-suited for handling large formal knowledge repositories and computing inferable coherences throughout such data, relying on their well-founded first-order semantics. In particular, DLs of reduced expressivity have proven a tremendous worth for handling large ontologies due to their computational tractability. In spite of these assets and prevailing influence, classical DLs are not well-suited to adequately model some of the most intuitive forms of reasoning. The capability for abductive reasoning is imperative for any field subjected to incomplete knowledge and the motivation to complete it with typical expectations. When such default expectations receive contradicting evidence, an abductive formalism is able to retract previously drawn, conflicting conclusions. Common examples often include human reasoning or a default characterisation of properties in biology, such as the normal arrangement of organs in the human body. Treatment of such defeasible knowledge must be aware of exceptional cases - such as a human suffering from the congenital condition situs inversus - and therefore accommodate for the ability to retract defeasible conclusions in a non-monotonic fashion. Specifically tailored non-monotonic semantics have been continuously investigated for DLs in the past 30 years. A particularly promising approach, is rooted in the research by Kraus, Lehmann and Magidor for preferential (propositional) logics and Rational Closure (RC). The biggest advantages of RC are its well-behaviour in terms of formal inference postulates and the efficient computation of defeasible entailments, by relying on a tractable reduction to classical reasoning in the underlying formalism. A major contribution of this work is a reorganisation of the core of this reasoning method, into an abstract framework formalisation. This framework is then easily instantiated to provide the reduction method for RC in DLs as well as more advanced closure operators, such as Relevant or Lexicographic Closure. In spite of their practical aptitude, we discovered that all reduction approaches fail to provide any defeasible conclusions for elements that only occur in the relational neighbourhood of the inspected elements. More explicitly, a distinguishing advantage of DLs over propositional logic is the capability to model binary relations and describe aspects of a related concept in terms of existential and universal quantification. Previous approaches to RC (and more advanced closures) are not able to derive typical behaviour for the concepts that occur within such quantification. The main contribution of this work is to introduce stronger semantics for the lightweight DL EL_bot with the capability to infer the expected entailments, while maintaining a close relation to the reduction method. We achieve this by introducing a new kind of first-order interpretation that allocates defeasible information on its elements directly. This allows to compare the level of typicality of such interpretations in terms of defeasible information satisfied at elements in the relational neighbourhood. A typicality preference relation then provides the means to single out those sets of models with maximal typicality. Based on this notion, we introduce two types of nested rational semantics, a sceptical and a selective variant, each capable of deriving the missing entailments under RC for arbitrarily nested quantified concepts. As a proof of versatility for our new semantics, we also show that the stronger Relevant Closure, can be imbued with typical information in the successors of binary relations. An extensive investigation into the computational complexity of our new semantics shows that the sceptical nested variant comes at considerable additional effort, while the selective semantics reside in the complexity of classical reasoning in the underlying DL, which remains tractable in our case

Fifth Conference on Artificial Intelligence for Space Applications

The Fifth Conference on Artificial Intelligence for Space Applications brings together diverse technical and scientific work in order to help those who employ AI methods in space applications to identify common goals and to address issues of general interest in the AI community. Topics include the following: automation for Space Station; intelligent control, testing, and fault diagnosis; robotics and vision; planning and scheduling; simulation, modeling, and tutoring; development tools and automatic programming; knowledge representation and acquisition; and knowledge base/data base integration

OPTIMIZATION OF NONSTANDARD REASONING SERVICES

The increasing adoption of semantic technologies and the corresponding increasing complexity of application requirements are motivating extensions to the standard reasoning paradigms and services supported by such technologies. This thesis focuses on two of such extensions: nonmonotonic reasoning and inference-proof access control. Expressing knowledge via general rules that admit exceptions is an approach that has been commonly adopted for centuries in areas such as law and science, and more recently in object-oriented programming and computer security. The experiences in developing complex biomedical knowledge bases reported in the literature show that a direct support to defeasible properties and exceptions would be of great help. On the other hand, there is ample evidence of the need for knowledge confidentiality measures. Ontology languages and Linked Open Data are increasingly being used to encode the private knowledge of companies and public organizations. Semantic Web techniques facilitate merging different sources of knowledge and extract implicit information, thereby putting at risk security and the privacy of individuals. But the same reasoning capabilities can be exploited to protect the confidentiality of knowledge. Both nonmonotonic inference and secure knowledge base access rely on nonstandard reasoning procedures. The design and realization of these algorithms in a scalable way (appropriate to the ever-increasing size of ontologies and knowledge bases) is carried out by means of a diversified range of optimization techniques such as appropriate module extraction and incremental reasoning. Extensive experimental evaluation shows the efficiency of the developed optimization techniques: (i) for the first time performance compatible with real-time reasoning is obtained for large nonmonotonic ontologies, while (ii) the secure ontology access control proves to be already compatible with practical use in the e-health application scenario.

A knowledge based reengineering approach via ontology and description logic.

Traditional software reengineering often involves a great deal of manual effort by software maintainers. This is time consuming and error prone. Due to the knowledge intensive properties of software reengineering, a knowledge-based solution is proposed in this thesis to semi-automate some of this manual effort. This thesis aims to explore the principle research question: “How can software systems be described by knowledge representation techniques in order to semi-automate the manual effort in software reengineering?” The underlying research procedure of this thesis is scientific method, which consists of: observation, proposition, test and conclusion. Ontology and description logic are employed to model and represent the knowledge in different software systems, which is integrated with domain knowledge. Model transformation is used to support ontology development. Description logic is used to implement ontology mapping algorithms, in which the problem of detecting semantic relationships is converted into the problem of deducing the satisfiability of logical formulae. Operating system ontology has been built with a top-down approach, and it was deployed to support platform specific software migration [132] and portable software development [18]. Data-dominant software ontology has been built via a bottom-up approach, and it was deployed to support program comprehension [131] and modularisation [130]. This thesis suggests that software systems can be represented by ontology and description logic. Consequently, it will help in semi-automating some of the manual tasks in software reengineering. However, there are also limitations: bottom-up ontology development may sacrifice some complexity of systems; top-down ontology development may become time consuming and complicated. In terms of future work, a greater number of diverse software system categories could be involved and different software system knowledge could be explored

Integration of Logic and Probability in Terminological and Inductive Reasoning

This thesis deals with Statistical Relational Learning (SRL), a research area combining principles and ideas from three important subfields of Artificial Intelligence: machine learn- ing, knowledge representation and reasoning on uncertainty. Machine learning is the study of systems that improve their behavior over time with experience; the learning process typi- cally involves a search through various generalizations of the examples, in order to discover regularities or classification rules. A wide variety of machine learning techniques have been developed in the past fifty years, most of which used propositional logic as a (limited) represen- tation language. Recently, more expressive knowledge representations have been considered, to cope with a variable number of entities as well as the relationships that hold amongst them. These representations are mostly based on logic that, however, has limitations when reason- ing on uncertain domains. These limitations have been lifted allowing a multitude of different formalisms combining probabilistic reasoning with logics, databases or logic programming, where probability theory provides a formal basis for reasoning on uncertainty. In this thesis we consider in particular the proposals for integrating probability in Logic Programming, since the resulting probabilistic logic programming languages present very in- teresting computational properties. In Probabilistic Logic Programming, the so-called "dis- tribution semantics" has gained a wide popularity. This semantics was introduced for the PRISM language (1995) but is shared by many other languages: Independent Choice Logic, Stochastic Logic Programs, CP-logic, ProbLog and Logic Programs with Annotated Disjunc- tions (LPADs). A program in one of these languages defines a probability distribution over normal logic programs called worlds. This distribution is then extended to queries and the probability of a query is obtained by marginalizing the joint distribution of the query and the programs. The languages following the distribution semantics differ in the way they define the distribution over logic programs. The first part of this dissertation presents techniques for learning probabilistic logic pro- grams under the distribution semantics. Two problems are considered: parameter learning and structure learning, that is, the problems of inferring values for the parameters or both the structure and the parameters of the program from data. This work contributes an algorithm for parameter learning, EMBLEM, and two algorithms for structure learning (SLIPCASE and SLIPCOVER) of probabilistic logic programs (in particular LPADs). EMBLEM is based on the Expectation Maximization approach and computes the expectations directly on the Binary De- cision Diagrams that are built for inference. SLIPCASE performs a beam search in the space of LPADs while SLIPCOVER performs a beam search in the space of probabilistic clauses and a greedy search in the space of LPADs, improving SLIPCASE performance. All learning approaches have been evaluated in several relational real-world domains. The second part of the thesis concerns the field of Probabilistic Description Logics, where we consider a logical framework suitable for the Semantic Web. Description Logics (DL) are a family of formalisms for representing knowledge. Research in the field of knowledge repre- sentation and reasoning is usually focused on methods for providing high-level descriptions of the world that can be effectively used to build intelligent applications. Description Logics have been especially effective as the representation language for for- mal ontologies. Ontologies model a domain with the definition of concepts and their properties and relations. Ontologies are the structural frameworks for organizing information and are used in artificial intelligence, the Semantic Web, systems engineering, software engineering, biomedical informatics, etc. They should also allow to ask questions about the concepts and in- stances described, through inference procedures. Recently, the issue of representing uncertain information in these domains has led to probabilistic extensions of DLs. The contribution of this dissertation is twofold: (1) a new semantics for the Description Logic SHOIN(D) , based on the distribution semantics for probabilistic logic programs, which embeds probability; (2) a probabilistic reasoner for computing the probability of queries from uncertain knowledge bases following this semantics. The explanations of queries are encoded in Binary Decision Diagrams, with the same technique employed in the learning systems de- veloped for LPADs. This approach has been evaluated on a real-world probabilistic ontology