Linh Nguyen

Governance is one of the core concepts underlying sustainable supply chain (SC). Although governance practices are widely acknowledged and implemented, literature discussing those practices is not as thoroughly organized. The purpose of this paper is therefore to investigate the forms, dynamics, and development of sustainable supply chain governance (SSCG). We reviewed a total of 126 articles in operations and SC management peer-reviewed journals spanning 15 years of recent research. Our literature analysis unveils several key themes concerning the popularity of contractual and relational governance, the role of SC lead firms, the network perspective, and the dynamics of governance mechanisms. At a higher conceptual level, we conclude that there exists a mutually dependent relationship between SSCG and SC complexity. The study summarizes and conceptualizes the recent scholarly conversations about SSCG and offers an agenda for further research.

In this paper we study automated reasoning in the modal logic CPDLreg which is a combination of CPDL (Propositional Dynamic Logic with Converse) and REGc (Regular Grammar Logic with Converse). The logic CPDL is widely used in many areas, including program verification, theory of action and change, and knowledge representation. On the other hand, the logic REGc is applicable in reasoning about epistemic states and ontologies (via Description Logics). The modal logic CPDLreg can serve as a technical foundation for reasoning about agency. Even very rich multi-agent logics can be embedded into CPDLreg via a suitable translation. Therefore, CPDLreg can serve as a test bed to implement and possibly verify new ideas without providing specific automated reasoning techniques for the logic in question. This process can to a large extent be automated. The idea of embedding various logics into CPDLreg is illustrated on a rather advanced logic TEAMLOGK designed to specify teamwork in multi-agent systems. Apart from defining informational and motivational attitudes of groups of agents, TEAMLOGK allows for grading agents' beliefs, goals and intentions. The current paper is a companion to our paper (Dunin-Kęplicz et al., 2010a). The main contribution are proofs of soundness and completeness of the tableau calculus for CPDLreg provided in (Dunin-Kęplicz et al., 2010a).

This study investigates the relationship between corporate governance and corporate sustainability performance in the emerging Asian markets where the central role of sustainable development was perceived after the 2008 global financial crisis. We base our study on the triple bottom line approach that incorporates three dimensions of sustainability: economic, environmental, and social performance. A governance index comprising ten firm-specific provisions is proposed to summarise internal corporate governance. Consistent with agency theory, we confirm that firms with better corporate governance have better corporate sustainability performance. We also determine which main factors drive the governance-sustainability relation. The findings have practical implications for firms, shareholders, and policy makers by emphasising the role of corporate governance in assessing and enhancing corporate sustainability performance.

There is a prominent phenomenon in the religious life of Vietnam, which is the emergence of “new religions”. These phenomena have not only made the religious space of the nation more complex and multi-dimensional but also challenged stability and sustainable development within the religious communities in this key economic region. Having studied the new religious phenomenon in recent years, we have noted its progress and widespread characteristics within the ethnic communities. While it may appear that "new religion" is a simple and gentle concept and practice, it is in fact, intrinsically related to and has significant implications on the social life of the community members. However, there is a growing concern, considerable suspicion and anxiety with regards to its impacts on individuals, families, social and cultural traditions, beliefs and religions; many have opined that it is radically changing the peaceful cohabitation of diverse religious traditions, revealing a potential for conflicts across groups. Based on the religious reality of the Southern region of Vietnam, the Center for Religion Studies has implemented a project regarding new religions in Ho Chi Minh City and the problems faced by the religious policy in Vietnam. This article is an overview of the results of this project.

We present optimizations for the modal logic programming system MProlog, including the standard form for resolution cycles, optimized sets of rules used as meta-clauses, optimizations for the version of MProlog without existential modal operators, as well as iterative deepening search and tabulation. Our SLD-resolution calculi for MProlog in a number of modal logics are still strongly complete when resolution cycles are in the standard form and optimized sets of rules are used. We also show that the labelling technique used in our direct approach is relatively better than the Skolemization technique used in the translation approaches for modal logic programming.

Grammar logics were introduced by Fariñas del Cerro and Penttonen in 1988 and have been widely studied. In this paper we consider regular grammar logics with converse ( REG c logics) and present sound and complete tableau calculi for the general satisfiability problem of REG c logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG c logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG c logics is coNP-complete

A serial context-free grammar logic is a normal multimodal logic L characterized by the seriality axioms and a set of inclusion axioms of the form □tφ→□s1…□skφ. Such an inclusion axiom corresponds to the grammar rule t → s1… sk. Thus the inclusion axioms of L capture a context-free grammar . If for every modal index t, the set of words derivable from t using is a regular language, then L is a serial regular grammar logic. In this paper, we present an algorithm that, given a positive multimodal logic program P and a set of finite automata specifying a serial regular grammar logic L, constructs a finite least L-model of P. A least L-model M of P has the property that for every positive formula φ, P ⊧ φ iff M ⊧ φ. The algorithm runs in exponential time and returns a model with size 2O. We give examples of P and L, for both of the case when L is fixed or P is fixed, such that every finite least L-model of P must have size 2Ω. We also prove that if G is a context-free grammar and L is the serial grammar logic corresponding to G then there exists a finite least L-model of □s p iff the set of words derivable from s using G is a regular language