نتایج جستجو برای: ethics is a conventional science
تعداد نتایج: 14224128 فیلتر نتایج به سال:
The focus of this paper is approaches to measuring similarity for application in connection with query evaluation. Rather than only comparing at the level of words the issue here is to compare concepts that appear as compound expressions derived from list of words through brief natural language analysis. Concepts refers to and are compared with respect to an ontology describing the domain of th...
With the increased use of ontologies in semantically-enabled applications, the issue of debugging defects in ontologies has become increasingly important. These defects can lead to wrong or incomplete results for the semanticallyenabled applications. Debugging consists of the phases of detection and repairing. In this paper we introduce a system for repairing a particular kind of defects, i.e. ...
For the effective alignment of ontologies, the subsumptionmappings between the elements of the source and target ontologies play a crucial role, as much as equivalence mappings do. This paper presents the “Classification-Based Learning of Subsumption Relations” (CSR) method for the alignment of ontologies. 2 December 2009 ccepted 4 January 2010
Abstract This paper will show that if we take conventional ethics seriously, then there is no moral justification for business profits. To this, explore three ethical theories, namely Christian ethics, Kantian and Utilitarian ethics. Since they essentially reject self-interest , also the essence of business: profit motive. illustrate relationship, concretize how anti-egoist perspective expresse...
This paper describes an indexing substrate for typed feature structures (ISTFS), which is an efficient retrieval engine for typed feature structures. Given a set of typed feature structures, the ISTFS efficiently retrieves its subset whose elements are unifiable or in a subsumption relation with a query feature structure. The efficiency of the ISTFS is achieved by calculating a unifiability che...
The design of comprehensive ontologies is a serious challenge. Therefore, it is necessary to support the ontology designer by providing him with design methodologies, ontology editors, and automated reasoning tools that explicate the consequences of his design decisions. Currently, reasoning tools are largely limited to the reasoning services (i) computing the subsumption hierarchy of the class...
Description Logics (DLs) are distinguished by a number of characteristics, including decidable reasoning algorithms for tasks such as subsumption and consistency checking. The desire for terminating, even efficient, reasoning procedures has led to two alternative approaches to DL system design: complete reasoning for expressively limited languages, and incomplete reasoning for richer languages....
The benefits of modular representations are well known from many areas of computer science. In this paper, we concentrate on the benefits of modular ontologies with respect to local containment of terminological reasoning. We define an architecture for modular ontologies that supports local reasoning by compiling implied subsumption relations. We further address the problem of guaranteeing the ...
chapters 1 and 2 establish the basic theory of amenability of topological groups and amenability of banach algebras. also we prove that. if g is a topological group, then r (wluc (g)) (resp. r (luc (g))) if and only if there exists a mean m on wluc (g) (resp. luc (g)) such that for every wluc (g) (resp. every luc (g)) and every element d of a dense subset d od g, m (r)m (f) holds. chapter 3 inv...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید