Article

On the ethical meaning of Iphigenia in Aulis

April 2010

Authors:

Iphigenia in Aulis is the tragedy of Euripides. Centering on the ethical knot of whether Iphigenia should be sacrificed or not, and through the descriptions of the characters such as Agamemnon, Menelaus, Clytemnestra and Iphigenia, the tragedy expresses the playwright's reflections on duty, responsibility, fame and life, and states the idea that when there is a conflict between collective interests and personal interests, emotions should give way to reason, and personal interests to collective interests. The portrayal of Iphigenia is not only the representation and the extension of Euripides'theme of sympathy for women, but also the praise of Iphigenia for her refined sentiment and noble character to sacrifice personal interests in order to preserve collective interests.

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Full-text available

A correlation coefficient of belief functions

December 2016 · International Journal of Approximate Reasoning

Wen Jiang

How to manage conflict is still an open issue in Dempster–Shafer (D-S) evidence theory. The conflict coefficient k in D-S evidence theory cannot represent conflict reasonably, especially sometimes two Basic Probability Assignments (BPAs) are identical but k is not zero. Jousselme distance can well measure the similarity or conflict between two BPAs but it becomes invalid in some cases. Some ... [Show full abstract] scholars introduced the concept of correlation coefficient to measure the similarity of two BPAs. However, existing correlation coefficients of BPAs are unstable or insensitive to quantify the conflict and sometimes deduce wrong results. In this paper, a novel correlation coefficient is proposed which takes into consideration both the non-intersection and the difference among the focal elements. It satisfies all the requirements for a metric. Some numerical examples and comparisons of this paper demonstrate the effectiveness of the correlation coefficient.

Conference Paper

Full-text available

A Reasoning Method in Conditional Evidential Networks based on DSm-PCR5

January 2015

To solve the problem that the evidence information on Dezert-Smarandache (DSm) model can not be effectively conditionally reasoned in multi-source heterogeneous a reasoning method in Conditional Evidential Network(ENC) based on DSm-Proportional Conflict Redistribution No.5(PCR5) is proposed. First, the conditional reasoning formula and the reasoning algorithm in Conditional Evidential Network ... [Show full abstract] based on DSm model is given. Then, the Disjunctive Rule of Combination(DRC) based on DSm-PCR5 is proposed and the Generalized Bayesian Theorem (GBT) for intersection sets of focal elements is obtained in the that the conditional mass assignments functions of focal in refinement of hyper-power set is known. Finally, the simulation e,periments results of situation assessment, the effectiveness of the proposed method is verified.

Article

A formal mapping-based approach for distributed schedule coordination on projects

January 2009 · Advanced Engineering Informatics

Construction projects involve a large number of participants with overlapping scope of work. Coordination of their activities is usually an iterative manual task undertaken by a general contractor that is often unaware of the detailed constraints of other participants. Project schedules play a key role in this coordination and form the backbone of almost all current approaches to process ... [Show full abstract] coordination. However, no single schedule represents the perspective of all participants involved in a project. Rather, each participant keeps in some manner a schedule for its own activities, resulting in multiple schedules that need to be coordinated. The current literature does not support simultaneous reasoning across multiple distributed, overlapping schedules. This paper introduces constructs to formalize the integration of participants’ overlapping schedules that represent the same project tasks, but use a different set breakdown structures and level of detail. Implementation of these constructs allows linking of the master schedule to the other participants’ schedules thereby representing the perspectives of all project participants. This integrated perspective facilitates initial schedule coordination and allows rapid identification of schedule conflicts in response to any schedule changes.

Chapter

Resources: Reusable, Consumable, Temporal

December 1988

David E. Wilkins

This chapter focuses on the concept of a reusable resource. Resources can be viewed as a powerful tool that can be employed by the user to represent domain-specific knowledge concerning the behavior of actions. The resource reasoning tool can be used to produce correct block-world plans, even if this is not the preferred way to approach the problem. Resources are not necessary for SIPE's ... [Show full abstract] block-world planning; the system would solve the same problems just as well without declaring any resources. SIPE uses a heuristic for solving resource-argument conflicts. Such an interaction occurs when a resource in one parallel branch is used as an argument in another parallel branch as distinguished from a resource–resource conflict, in which the same object is used as a resource in two parallel.

Article

Event Structure Semantics for Dynamic Graph Grammars

January 2007

Dynamic graph grammars (DGGs) are a reflexive extension of Graph Grammars that have been introduced to represent mobile reflexive systems and calculi at a convenient level of abstraction. Persistent graph grammars (PGGs) are a class of graph grammars that admits a fully satisfactory concurrent semantics thanks to the fact that all so-called asymmetric conflicts (between items that are read by ... [Show full abstract] some productions and consumed by other) are avoided. In this paper we introduce a slight variant of DGGs, called persistent dynamic graph grammars (PDGGs), that can be encoded in PGGs preserving concurrency. Finally, PDGGs are exploited to define a concurrent semantics for the Join calculus enriched with persistent messaging (if preferred, the latter can be naively seen as dynamic nets with read arcs).

Article

A Method for Aggregating Ranked Services for Personal Preference Based Selection

April 2019 · International Journal of Web Services Research

Kenneth Kofi Fletcher

Typically, users' service requests, which are similar with varying preferences on non-functional attributes, may result in ranked lists of services that partially meet their needs due to conflicting non-functional attributes. The resultant multiple ranked lists of services that partially satisfies the user's request makes it challenging for the user to choose an optimal service, based on his/her ... [Show full abstract] preference. This work proposes a method that aggregates multiple ranked lists of services into a single aggregated ranked list, where top ranked services are selected for the user. Two algorithms are proposed; 1) Rank Aggregation for Complete Lists (RACoL), that aggregates complete ranked lists and 2) Rank Aggregation for Incomplete Lists (RAIL) to aggregate incomplete ranked lists. Examples using real-world airline services to evaluate both algorithms show that the results from both proposed algorithms closely represent the sets of ranked lists better than using alternative approaches. Experiments were also carried out to validate their performance.

Chapter

Work‐Family Spillover: From Conflict to Harmony

February 2009

Beyond Work-Family BalanceRedefining RolesLife Management StrategiesArranging Water Molecules

Article

Iterative Refinement of Knowledge Bases with Consistency Guarantees

February 1997

Natural kinds, such as the concepts toy block or photosynthesis, are ubiquitous in human reasoning yet lack definitional (i.e., individually necessary and jointly sufficient) properties as membership conditions. We want to represent a wide variety of assertions about these natural concepts with precision and logical consistency. Furthermore, we want to be able to verify that the meaning of each ... [Show full abstract] concept does not conflict with the constraints implied by its constituents. Classification-based approaches to these tasks have relied on definitional properties in order to deduce subsumption and thus detect inconsistency. These approaches are inapplicable for building representations of natural concepts. Our solution to these problems is twofold. First, we build KBs by iterative refinement; i.e., the KB is constructed through a sequence of editing operations. Second, we define practical, yet formal, properties of concept satisfiability and inheritance that each operator is guaranteed to prese...

Technical Report

Full-text available

Developing Components in Presence of Re-entrance

February 1999

Independent development of components according to their specifications is complicated by the fact that a thread of control can exit and re-enter the same component. This kind of re-entrance may cause problems as the internal representation of a component can be observed in an inconsistent state. We argue that the ad-hoc reasoning used in establishing conformance of components to their ... [Show full abstract] specifications that intuitively appears to be correct does not account for the presence of re-entrance. Such reasoning leads to a conflict between assumptions that component developers make about the behavior of components in a system, resulting in the component re-entrance problem. We formulate the modular reasoning property that captures the process of independent component development and introduce two requirements that must be imposed to avoid the re-entrance problem. Then we define a customized theory of components, component systems, and component refinement which models the process of component development from specifications. Using this theory, we prove that the formulated requirements are sufficient to establish the modular reasoning property.

Article

Full-text available

REASONING ABOUT DEFINITIONS IN STATUTES

January 1970

Summary The formalization of texts of law entails the analysis of its structure. Often, the structure is modified and (parts of) legal norms are reformulated on an ad hoc basis, to suit the selected representation method. A theory about coherence in law can serve as a basis to extract and represent knowledge about the structure of texts of law. This knowledge can be used to reason about separate ... [Show full abstract] text elements, thus making it possible to preserve the structure of these texts. As we will show, meta-level reasoning is needed to deal with conflicts that arise if the structure of the statute is preserved. In this paper, we concentrate on reasoning about definitions.

Article

Full-text available

Developing Components in the Presence of Re-entrance

March 1999 · Lecture Notes in Computer Science

Independent development of components according to their specifications is complicated by the fact that a thread of control can exit and re-enter the same component. This kind of re-entrance may cause problems as the internal representation of a component can be observed in an inconsistent state. We argue that the ad-hoc reasoning used in establishing conformance of components to their ... [Show full abstract] specifications that intuitively appears to be correct does not account for the presence of re-entrance. Such reasoning leads to a conflict between assumptions that component developers make about the behaviour of components in a system, resulting in the component re-entrance problem. We formulate the modular reasoning property that captures the process of independent component development and introduce two requirements that must be imposed to avoid the re-entrance problem. Then we define a customised theory of components, component systems, and component refinement which models the process of component development from specifications. Using this theory, we prove that the formulated requirements are sufficient to establish the modular reasoning property.

Conference Paper

Full-text available

Developing Components in the Presence of Re-entrance

September 1999 · Lecture Notes in Computer Science

Independent development of components according to their specifications is complicated by the fact that a thread of control can exit and re-enter the same component. This kind of re-entrance may cause problems as the internal representation of a component can be observed in an inconsistent state. We argue that the ad-hoc reasoning used in establishing conformance of components to their ... [Show full abstract] specifications that intuitively appears to be correct does not account for the presence of re-entrance. Such reasoning leads to a conflict between assumptions that component developers make about the behavior of components in a system, resulting in the component re-entrance problem. We formulate the modular reasoning property that captures the process of independent component development and introduce two requirements that must be imposed to avoid the re-entrance problem. Then we define a customized theory of components, component systems, and component refinement which models the process of component development from specifications. Using this theory, we prove that the formulated requirements are sufficient to establish the modular reasoning property.