This Handbook is a combination of authoritative exposition, comprehensive survey, and fundamental research exploring the underlying unifying themes in the various areas. The intended audience is graduate students and researchers in the areas of computing and logic, as well as other people interested in the subject. We assume as background some mathematical sophistication. Much of the material will also be of interest to logicians and mathematicians.

Agenda Relevance is the first volume in the authors' omnibus investigation of the logic of practical reasoning, under the collective title, A Practical Logic of Cognitive Systems. In this highly original approach, practical reasoning is identified as reasoning performed with comparatively few cognitive assets, including resources such as information, time and computational capacity. Unlike what is proposed in optimization models of human cognition, a practical reasoner lacks perfect information, boundless time and unconstrained access to computational complexity. The practical reasoner is (...) therefore obliged to be a cognitive economizer and to achieve his cognitive ends with considerable efficiency. Accordingly, the practical reasoner avails himself of various scarce-resource compensation strategies. He also possesses neurocognitive traits that abet him in his reasoning tasks. Prominent among these is the practical agent's striking (though not perfect) adeptness at evading irrelevant information and staying on task. On the approach taken here, irrelevancies are impediments to the attainment of cognitive ends. Thus, in its most basic sense, relevant information is cognitively helpful information. Information can then be said to be relevant for a practical reasoner to the extent that it advances or closes some cognitive agenda of his. The book explores this idea with a conceptual detail and nuance not seen the standard semantic, probabilistic and pragmatic approaches to relevance; but wherever possible, the authors seek to integrate alternative conceptions rather than reject them outright. A further attraction of the agenda-relevance approach is the extent to which its principal conceptual findings lend themselves to technically sophisticated re-expression in formal models that marshal the resources of time and action logics and label led deductive systems. Agenda Relevance is necessary reading for researchers in logic, belief dynamics, computer science, AI, psychology and neuroscience, linguistics, argumentation theory, and legal reasoning and forensic science, and will repay study by graduate students and senior undergraduates in these same fields. Key features: relevance action and agendas practical reasoning belief dynamics non-classical logics labelled deductive systems. (shrink)

Goal Directed Proof Theory presents a uniform and coherent methodology for automated deduction in non-classical logics, the relevance of which to computer science is now widely acknowledged. The methodology is based on goal-directed provability. It is a generalization of the logic programming style of deduction, and it is particularly favourable for proof search. The methodology is applied for the first time in a uniform way to a wide range of non-classical systems, covering intuitionistic, intermediate, modal and substructural logics. The book (...) can also be used as an introduction to these logical systems form a procedural perspective. Readership: Computer scientists, mathematicians and philosophers, and anyone interested in the automation of reasoning based on non-classical logics. The book is suitable for self study, its only prerequisite being some elementary knowledge of logic and proof theory. (shrink)

Inductive Logic is number ten in the 11-volume Handbook of the History of Logic. While there are many examples were a science split from philosophy and became autonomous (such as physics with Newton and biology with Darwin), and while there are, perhaps, topics that are of exclusively philosophical interest, inductive logic — as this handbook attests — is a research field where philosophers and scientists fruitfully and constructively interact. This handbook covers the rich history of scientific turning points in Inductive (...) Logic, including probability theory and decision theory. Written by leading researchers in the field, both this volume and the Handbook as a whole are definitive reference tools for senior undergraduates, graduate students and researchers in the history of logic, the history of philosophy, and any discipline, such as mathematics, computer science, cognitive psychology, and artificial intelligence, for whom the historical background of his or her work is a salient consideration. (shrink)

The notion of negation is basic to any formal or informal logical system. When any such system is presented to us, it is presented either as a system without negation or as a system with some form of negation. In both cases, we are supposed to know intuitively whether there is no negation in the system or whether the form of negation presented in the system is indeed as claimed. To be more specific, suppose Robinson Crusoe writes a logical system (...) with Hilbert-type axioms and rules, which includes a unary connective ∗A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*A$$\end{document}. He puts the document in a bottle and lets it lose at sea. We find it and take a look. We ask: is the connective “∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*$$\end{document}” a negation in the system? Yet the notion of what is negation in a formal system is not clear. When we see a unary connective ∗A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*A$$\end{document}, together with some other axioms for some additional connectives, how can we tell whether ∗A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*A$$\end{document} is indeed a form of negation of A? Are there some axioms which the connective “∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*$$\end{document}” must satisfy in order to qualify ∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*$$\end{document} as a negation? (shrink)

This book is a specialized monograph on interpolation and definability, a notion central in pure logic and with significant meaning and applicability in all areas where logic is applied, especially computer science, artificial intelligence, logic programming, philosophy of science and natural language. Suitable for researchers and graduate students in mathematics, computer science and philosophy, this is the latest in the prestigous world-renowned Oxford Logic Guides, which contains Michael Dummet's Elements of intuitionism, J. M. Dunn and G. Hardegree's Algebraic Methods in (...) Philosophical Logic, H. Rott's Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning, P. T. Johnstone's Sketches of an Elephant: A Topos Theory Compendium: Volumes 1 and 2, and David J. Pym and Eike Ritter's Reductive Logic and Proof Search: Proof theory, semantics and control. (shrink)

Recent years have been blessed with an abundance of logical systems, arising from a multitude of applications. A logic can be characterised in many different ways. Traditionally, a logic is presented via the following three components: 1. an intuitive non-formal motivation, perhaps tie it in to some application area 2. a semantical interpretation 3. a proof theoretical formulation. There are several types of proof theoretical methodologies, Hilbert style, Gentzen style, goal directed style, labelled deductive system style, and so on. The (...) tableau methodology, invented in the 1950s by Beth and Hintikka and later per fected by Smullyan and Fitting, is today one of the most popular, since it appears to bring together the proof-theoretical and the semantical approaches to the pre of a logical system and is also very intuitive. In many universities it is sentation the style first taught to students. Recently interest in tableaux has become more widespread and a community crystallised around the subject. An annual tableaux conference is being held and proceedings are published. The present volume is a Handbook a/Tableaux pre senting to the community a wide coverage of tableaux systems for a variety of logics. It is written by active members of the community and brings the reader up to frontline research. It will be of interest to any formal logician from any area. (shrink)

In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the (complete) extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment.

This article deals with a set-theoretic interpretation of the Talmudic rules of General and Specific, known as Klal and Prat (KP), Prat and Klal (PK), Klal and Prat and Klal (KPK) and Prat and Klal and Prat (PKP).

The Handbook of Formal Argumentation is a community effort aimed at providing a comprehensive and up-to-date view of the state of the art and current trends in the lively research field of formal argumentation. The first volume of the Handbook is organised into five parts, containing nineteen chapters in all, each written by leading experts in the field. The first part provides a general and historical perspective on the field. The second part gives a comprehensive coverage of the argumentation formalisms (...) available in the literature at various levels of abstraction. The third part is devoted to cover some of the many dialogical aspects of argumentation, while the fourth one deals with algorithmic, computational and implementation issues. Finally, the fifth part provides some deeper analyses on the previously introduced topics. The Handbook of Formal Argumentation is an open-ended initiative of which the present volume is the first outcome. Further volumes are planned to cover topics not included in the present one and the initiative is conceived to grow by the support and feeding it receives from the community members. (shrink)

This paper studies general numerical networks with support and attack. Our starting point is argumentation networks with the Caminada labelling of three values 1=in, 0=out and ½=undecided. This is generalised to arbitrary values in [01], which enables us to compare with other numerical networks such as predator?prey ecological networks, flow networks, logical modal networks and more. This new point of view allows us to see the place of argumentation networks in the overall landscape of networks and import and export ideas (...) to and from argumentation networks. We make a special effort to make clear how general concepts in general networks relate to the special case of argumentation networks. We pay special attention to the handling of loops and to the special features of numerical support. We find surprising connections with the Dempster?Shafer rule and with the cross-ratio in projective geometry. This paper is an expansion of our 2005 paper and so we also consider higher level features such as numerical attacks on attacks, and propagation of numerical values.We conclude with a brief view of temporal numerical argumentation and with a detailed comparison with related papers published since 2005. (shrink)

We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix $${\mathbb {A}}$$ with entries in {0, 1}, we allow for one or more blank squares in the matrix, say a i,j =?. The method allows us to decide whether to declare a i,j = 0 or a i,j = 1 or a i,j =? (...) undecided. This algorithmic method is then applied to modelling several legal and practical reasoning situations including the Talmudic rule of Kal-Vachomer. We add an Appendix showing that this new rule of Matrix Abduction, arising from the Talmud, can also be applied to the analysis of paradoxes in voting and judgement aggregation. In fact we have here a general method for executing non-deductive inferences. (shrink)

In this paper we provide a detailed proof-theoretical analysis of a natural deduction system for classical propositional logic that (i) represents classical proofs in a more natural way than standard Gentzen-style natural deduction, (ii) admits of a simple normalization procedure such that normal proofs enjoy the Weak Subformula Property, (iii) provides the means to prove a Non-contamination Property of normal proofs that is not satisfied by normal proofs in the Gentzen tradition and is useful for applications, especially in formal argumentation, (...) (iv) naturally leads to defining a notion of depth of a proof, to the effect that, for every fixed natural k, normal k-depth deducibility is a tractable problem and converges to classical deducibility as k tends to infinity. (shrink)

In this paper, we introduce the methodology and techniques of metaargumentation to model argumentation. The methodology of meta-argumentation instantiates Dung's abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung's basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung's theory of abstract argumentation to itself, by instantiating Dung's abstract arguments with meta-arguments using a technique called flattening. (...) We characterize the domain of instantiation using a representation technique based on soundness and completeness. Finally, we distinguish among various instantiations using the technique of specification languages. (shrink)

In this paper, we introduce the methodology and techniques of meta-argumentation to model argumentation. The methodology of meta-argumentation instantiates Dung’s abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung’s basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung’s theory of abstract argumentation to itself, by instantiating Dung’s abstract arguments with meta-arguments using a technique called flattening. (...) We characterize the domain of instantiation using a representation technique based on soundness and completeness. Finally, we distinguish among various instantiations using the technique of specification languages. (shrink)

This paper examines the deontic logic of the Talmud. We shall find, by looking at examples, that at first approximation we need deontic logic with several connectives: O T A Talmudic obligation F T A Talmudic prohibition F D A Standard deontic prohibition O D A Standard deontic obligation. In classical logic one would have expected that deontic obligation O D is definable by $O_DA \equiv F_D\neg A$ and that O T and F T are connected by $O_TA \equiv F_T\neg (...) A$ This is not the case in the Talmud for the T (Talmudic) operators, though it does hold for the D operators. We must change our underlying logic. We have to regard {O T , F T } and {O D , F D } as two sets of operators, where O T and F T are independent of one another and where we have some connections between the two sets. We shall list the types of obligation patterns appearing in the Talmud and develop an intuitionistic deontic logic to accommodate them. We shall compare Talmudic deontic logic with modern deontic logic. (shrink)

We introduce a methodology whereby an arbitrary logic system L can be enriched with temporal features to create a new system T(L). The new system is constructed by combining L with a pure propositional temporal logic T (such as linear temporal logic with Since and Until) in a special way. We refer to this method as adding a temporal dimension to L or just temporalising L. We show that the logic system T(L) preserves several properties of the original temporal logic (...) like soundness, completeness, decidability, conservativeness and separation over linear flows of time. We then focus on the temporalisation of first-order logic, and a comparison is make with other first-order approaches to the handling of time. (shrink)

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work by researchers (...) in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations. (shrink)

Deontic logic, as traditionally conceived, provides only a deductive theory that constrains the states or possible worlds within which an agent should try to remain.

This paper offers a two dimensional variation of Standard Deontic Logic SDL, which we call 2SDL. Using 2SDL we can show that we can overcome many of the difficulties that SDL has in representing linguistic sets of Contrary-to-Duties (known as paradoxes) including the Chisholm, Ross, Good Samaritan and Forrester paradoxes. We note that many dimensional logics have been around since 1947, and so 2SDL could have been presented already in the 1970s. Better late than never! As a detailed case study (...) illustrating the power of 2SDL, we examine the system DL of Deontic Logic of Andrew Jones and Ingmar Pörn offered in 1985 to solve the Chisholm paradox of Contrary to Duties. The critical examination is done using logics and methods available in 1985 and solutions are proposed using what was available in 1985. (shrink)

In this paper, we introduce the methodology and techniques of meta-argumentation to model argumentation. The methodology of meta-argumentation instantiates Dung’s abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung’s basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung’s theory of abstract argumentation to itself, by instantiating Dung’s abstract arguments with meta-arguments using a technique called flattening. (...) We characterize the domain of instantiation using a representation technique based on soundness and completeness. Finally, we distinguish among various instantiations using the technique of specification languages. (shrink)

In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumentation and the stable models in logic programming.

This paper gives a simple method for providing categorial brands of feature-based unification grammars with a model-theoretic semantics. The key idea is to apply the paradigm of fibred semantics (or layered logics, see Gabbay (1990)) in order to combine the two components of a feature-based grammar logic. We demonstrate the method for the augmentation of Lambek categorial grammar with Kasper/Rounds-style feature logic. These are combined by replacing (or annotating) atomic formulas of the first logic, i.e. the basic syntactic types, (...) by formulas of the second. Modelling such a combined logic is less trivial than one might expect. The direct application of the fibred semantics method where a combined atomic formula like np (num: sg & pers: 3rd) denotes those strings which have the indicated property and the categorial operators denote the usual left- and right-residuals of these string sets, does not match the intuitive, unification-based proof theory. Unification implements a global bookkeeping with respect to a proof whereas the direct fibring method restricts its view to the atoms of the grammar logic. The solution is to interpret the (embedded) feature terms as global feature constraints while maintaining the same kind of fibred structures. For this adjusted semantics, the anticipated proof system is sound and complete. (shrink)

This paper investigates modular combinations of temporal logic systems. Four combination methods are described and studied with respect to the transfer of logical properties from the component one-dimensional temporal logics to the resulting combined two-dimensional temporal logic. Three basic logical properties are analyzed, namely soundness, completeness, and decidability. Each combination method comprises three submethods that combine the languages, the inference systems, and the semantics of two one-dimensional temporal logic systems, generating families of two-dimensional temporal languages with varying expressivity and varying (...) degrees of transfer of logical properties. The temporalization method and the independent combination method are shown to transfer all three basic logical properties. The method of full join of logic systems generates a considerably more expressive language but fails to transfer completeness and decidability in several cases. So a weaker method of restricted join is proposed and shown to transfer all three basic logical properties. (shrink)

We study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language (both for classical and intuitionistic fragment), we then prove that in order (...) to express well-known properties like 'speaks-for' or 'hand- off', defined in terms of says, we do not need second-order logic (unlike previous approaches) but a decidable fragment of first-order logic suffices. We propose a model-driven study of the says axiomatization by constraining the Kripke models in order to respect desirable security properties, we study how existing access control logics can be translated into FSL and we give completeness for the logic. (shrink)

We study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language both for classical and intuitionistic fragment), we then prove that in order (...) to express well-known properties like ‘speaks-for’ or ‘hand-off’, defined in terms of says, we do not need second-order logic (unlike previous approaches) but a decidable fragment of first-order logic suffices. We propose a model-driven study of the says axiomatization by constraining the Kripke models in order to respect desirable security properties, we study how existing access control logics can be translated into FSL and we give completeness for the logic. (shrink)

Community engagement (CE) contributes to successful research. There is, however, a lack of literature on the effectiveness of different models of CE and, specifically, on CE strategies for the conduct of genomic research in sub-Saharan Africa. There is also a need for models of CE that transcend the recruitment stage of engaging prospective individuals and communities and embed CE throughout the research process and after the research has concluded. The qualitative study reported here was designed to address these knowledge gaps (...) and comprised of 36 key informant semi-structured interviews and fifteen focus groups with 50 participants. We interviewed selected stakeholders in genomic research in Nigeria: biomedical researchers, community rulers, opinion leaders, community health workers, and prospective research participants. We explored these stakeholders’ views on their understanding of community engagement, their expectations, experiences, and their opinions on acceptable processes of community consultation in genomic research. The methodological design, adapted from grounded theory, used the constant comparative method of data analysis; while normative conclusions were made using the symbiotic empirical ethics approach. Data analysis revealed five main themes important for successfully engaging communities in genomic research: effective communication, diversity of community gatekeeping, trust, cultural integration of research, and conservation of the research setting. From these themes, we have developed a four-stage model of community engagement that covers all stages of the research process; namely, the Community Approach, Intermediate phase, Collaboration and Post-research Cordiality model (CICP). This model could be used to improve the integration of CE in genomic research among local communities. (shrink)

We consider conditionals of the form A ⇒ B where A depends on the future and B on the present and past. We examine models for such conditional arising in Talmudic legal cases. We call such conditionals contrary to time conditionals.Three main aspects will be investigated: Inverse causality from future to past, where a future condition can influence a legal event in the past (this is a man made causality).Comparison with similar features in modern law.New types of temporal logics arising (...) from modelling the Talmudic examples. We shall see that we need a new temporal logic,which we call Talmudic temporal logic with linear open advancing future and parallel changing past, based on two parameters for time. (shrink)

The traditional Dung networks depict arguments as atomic and study the relationships of attack between them. This can be generalised in two ways. One is to consider various forms of attack, support, feedback, etc. Another is to add content to nodes and put there not just atomic arguments but more structure, e.g. proofs in some logic or simply just formulas from a richer language. This paper offers to use temporal and modal language formulas to represent arguments in the nodes of (...) a network. The suitable semantics for such networks is Kripke semantics. We also introduce a new key concept of usability of an argument. This is the beginning of a continuing research for adding contents to the nodes of an argumentation network. This research will allow us to address notions like ?what does it exactly mean for a node to attack another? or ?what does it mean for a network to be consistent? or ?can we give proper proof rules to manipulate networks?, and more. (shrink)

Community engagement (CE) contributes to successful research. There is, however, a lack of literature on the effectiveness of different models of CE and, specifically, on CE strategies for the conduct of genomic research in sub-Saharan Africa. There is also a need for models of CE that transcend the recruitment stage of engaging prospective individuals and communities and embed CE throughout the research process and after the research has concluded. The qualitative study reported here was designed to address these knowledge gaps (...) and comprised of 36 key informant semi-structured interviews and fifteen focus groups with 50 participants. We interviewed selected stakeholders in genomic research in Nigeria: biomedical researchers, community rulers, opinion leaders, community health workers, and prospective research participants. We explored these stakeholders’ views on their understanding of community engagement, their expectations, experiences, and their opinions on acceptable processes of community consultation in genomic research. The methodological design, adapted from grounded theory, used the constant comparative method of data analysis; while normative conclusions were made using the symbiotic empirical ethics approach. Data analysis revealed five main themes important for successfully engaging communities in genomic research: effective communication, diversity of community gatekeeping, trust, cultural integration of research, and conservation of the research setting. From these themes, we have developed a four-stage model of community engagement that covers all stages of the research process; namely, the Community Approach, Intermediate phase, Collaboration and Post-research Cordiality model (CICP). This model could be used to improve the integration of CE in genomic research among local communities. (shrink)

Community engagement (CE) contributes to successful research. There is, however, a lack of literature on the effectiveness of different models of CE and, specifically, on CE strategies for the conduct of genomic research in sub-Saharan Africa. There is also a need for models of CE that transcend the recruitment stage of engaging prospective individuals and communities and embed CE throughout the research process and after the research has concluded. The qualitative study reported here was designed to address these knowledge gaps (...) and comprised of 36 key informant semi-structured interviews and fifteen focus groups with 50 participants. We interviewed selected stakeholders in genomic research in Nigeria: biomedical researchers, community rulers, opinion leaders, community health workers, and prospective research participants. We explored these stakeholders’ views on their understanding of community engagement, their expectations, experiences, and their opinions on acceptable processes of community consultation in genomic research. The methodological design, adapted from grounded theory, used the constant comparative method of data analysis; while normative conclusions were made using the symbiotic empirical ethics approach. Data analysis revealed five main themes important for successfully engaging communities in genomic research: effective communication, diversity of community gatekeeping, trust, cultural integration of research, and conservation of the research setting. From these themes, we have developed a four-stage model of community engagement that covers all stages of the research process; namely, the Community Approach, Intermediate phase, Collaboration and Post-research Cordiality model (CICP). This model could be used to improve the integration of CE in genomic research among local communities. (shrink)