After a number of decades of research into the dynamics of rational belief, the belief revision theory community remains split on the appropriate handling of sequences of changes in view, the issue of so-called iterated revision. It has long been suggested that the matter is at least partly settled by facts pertaining to the results of various single revisions of one’s initial state of belief. Recent work has pushed this thesis further, offering various strong principles that ultimately result in a (...) wholesale reduction of iterated to one-shot revision. The present paper offers grounds to hold that these principles should be significantly weakened and that the reductionist thesis should ultimately be rejected. Furthermore, the considerations provided suggest a close connection between the logic of iterated belief change and the logic of evidential relevance. (shrink)

Orthodox semantics for natural language modals give rise to two puzzles for their interactions with disjunction: Ross’s puzzle and the puzzle of free choice permission. It is widely assumed that each puzzle can be explained in terms of the licensing of ‘Diversity’ inferences: from the truth of a possibility or necessity modal with an embedded disjunction, hearers infer that each disjunct is compatible with the relevant set of worlds. I argue that Diversity inferences are too weak to explain the full (...) range of data. Instead, I argue, modals with embedded disjunctions license ‘Independence’ inferences: from the truth of a modal with an embedded disjunction, hearers infer that each disjunct is an independent alternative among the relevant set of worlds. I then develop a bilateral inquisitive semantics for modals that predicts the validity of these Independence inferences. My account vindicates common intuitions about both Ross’s puzzle and the puzzle of free choice permission, and explains the full range of data. (shrink)

People high in depressive or anxious symptom severity show repetitive negative thinking, including worry and rumination. They also show various cognitive phenomena, including probability, cost, and interpretation biases. Since there is conceptual overlap between these cognitive biases and repetitive negative thinking – all involve thinking about potential threats and misfortunes – we wondered whether repetitive negative thinking could account for (mediate) these cognitive biases’ associations with depressive and anxious symptom severity. In three studies, conducted in two languages and cultures, cost (...) bias and (in two studies) interpretation bias only predicted symptom severity via worry and repetitive negative thinking; this suggests these biases are actually associated with repetitive negative thinking, rather than with symptoms. In contrast, probability bias showed direct relationships with depressive (all studies) and anxious (two studies) symptom severity, suggesting its relationships with symptoms are partly independent of repetitive negative thinking. These results show the value of studying relationships among the various cognitive features of psychopathology. Furthermore, new interventions which target cognitive biases in depression or anxiety must show that they can improve upon cognitive behavioural therapy, which is already widely available, targets both repetitive negative thinking and probability bias, and is highly effective. (shrink)

Critical thinking about international politics often involves reasoning about the beliefs, goals, appraisals, actions, and plans of actors such as countries, governments, politicians, etc. We analyzed arguments in interpretive reports about international politics, in order to develop a prototype argument diagramming tool for this domain, AVIZE (Argument Visualization and Evaluation). The purpose of AVIZE is to aid users in the construction and self-evaluation of real-world arguments in the domain of international politics. AVIZE provides a set of argument schemes as cognitive (...) building blocks for constructing argument diagrams. Most of the schemes are related to concepts from the field of automated plan recognition in artificial intelligence. While some currently available argument diagramming tools provide schemes, they are not tailored to the domain of international politics. This paper describes the argument schemes for this domain and the design of the argument diagramming tool. (shrink)

Most approaches to iterated belief revision are accompanied by some motivation for the use of the proposed revision operator (or family of operators), and typically encode enough information in the epistemic state of an agent for uniquely determining one-step revision. But in those approaches describing a family of operators there is usually little indication of how to proceed uniquely after the first revision step. In this paper we contribute towards addressing that deficiency by providing a formal framework which goes beyond (...) the first revision step in two ways. First, the framework is obtained by enriching the epistemic state of an agent starting from the following intuitive idea: we associate to each world x two abstract objects x⁺ and x⁻, and we assume that, in addition to preferences over the set of worlds, we are given preferences over this set of objects as well. The latter can be considered as meta-information encoded in the epistemic state which enables us to go beyond the first revision step of the revision operator being applied, and to obtain a unique set of preferences over worlds. We then extend this framework to consider, not only the revision of preferences over worlds, but also the revision of this extended structure itself. We look at some desirable properties for revising the structure and prove the consistency of these properties by giving a concrete operator satisfying all of them. Perhaps more importantly, we show that this framework has strong connections with two other types of constructions in related areas. Firstly, it can be seen as a special case of preference aggregation which opens up the possibility of extending the frame-work presented here into a full-fledged framework for preference aggregation and social choice theory. Secondly, it is related to existing work on the use of interval orderings in a number of different contexts. (shrink)

Discussions of the issue of iterated belief revision are commonly accompanied by the presentation of three “concrete” operators: natural, restrained and lexicographic. This raises a natural question: What is so distinctive about these three particular methods? Indeed, the common axiomatic ground for work on iterated revision, the AGM and Darwiche-Pearl postulates, leaves open a whole range of alternative proposals. In this paper, we show that it is satisfaction of an additional principle of “Independence of Irrelevant Alternatives”, inspired by the literature (...) on Social Choice, that unites and sets apart our three “elementary” revision operators. A parallel treatment of iterated belief contraction is also given, yielding a family of elementary contraction operators that includes, besides the well-known “conservative” and “moderate” operators, a new contraction operator that is related to restrained revision. (shrink)

The field of iterated belief change has focused mainly on revision, with the other main operator of AGM belief change theory, i.e. contraction, receiving relatively little attention. In this paper we extend the Harper Identity from single-step change to define iterated contraction in terms of iterated revision. Specifically, just as the Harper Identity provides a recipe for defining the belief set resulting from contracting A in terms of (i) the initial belief set and (ii) the belief set resulting from revision (...) by ¬A, we look at ways to define the plausibility ordering over worlds resulting from contracting A in terms of (iii) the initial plausibility ordering, and (iv) the plausibility ordering resulting from revision by ¬A. After noting that the most straightforward such extension leads to a trivialisation of the space of permissible orderings, we provide a family of operators for combining plausibility orderings that avoid such a result. These operators are characterised in our domain of interest by a pair of intuitively compelling properties, which turn out to enable the derivation of a number of iterated contraction postulates from postulates for iterated revision. We finish by observing that a salient member of this family allows for the derivation of counterparts for contraction of some well known iterated revision operators, as well as for defining new iterated contraction operators. (shrink)

ABSTRACTPeople high in negative affect tend to think negative events are more likely than positive events. Studies have found that weak attentional control exaggerates another...

The ANGELIC methodology was developed to encapsulate knowledge of particular legal domains. In this paper we describe its use to build a full scale practical application intended to be used internally by Weightmans, a large firm of legal practitioners with branches throughout the UK. We describe the domain, Noise Induced Hearing Loss (NIHL), the intended task, the sources used, the stages in development and the resulting application. An assessment of the project and its potential for further development is discussed. The (...) project shows that current academic research using computational models of argument can prove useful to legal practitioners confronted by real legal tasks. (shrink)

The notion of the rational closure of a positive knowledge base K of conditional assertions θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} |∼ φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} (standing for if θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} then normally φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document}) was first introduced by Lehmann (1989) and developed by Lehmann and Magidor (...) (1992). Following those authors we would also argue that the rational closure is, in a strong sense, the minimal information, or simplest, rational consequence relation satisfying K. In practice, however, one might expect a knowledge base to consist not just of positive conditional assertions, θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} |∼ φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document}, but also negative conditional assertions, θi φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} (standing for not if θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} then normally φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document}. Restricting ourselves to a finite language we show that the rational closure still exists for satisfiable knowledge bases containing both positive and negative conditional assertions and has similar properties to those exhibited in Lehmann and Magidor (1992). In particular an algorithm in Lehmann and Magidor (1992) which constructs the rational closure can be adapted to this case and yields, in turn, completeness theorems for the conditional assertions entailed by such a mixed knowledge base. (shrink)

The task of data collection is becoming routine in many disciplines and this results in increased availability of data. This routinely collected data provides a valuable opportunity for analysis with a view to support evidence based decision making. In order to confidently leverage the data in support of decision making the most appropriate statistical method needs to be selected, and this can be difficult for an end user not trained in statistics. This paper outlines an application of argumentation to support (...) the analysis of clinical data, that uses Extended Argumentation Frameworks in order to reason with the meta-level arguments derived from preference contexts relevant to the data and the analysis objective of the end user. We outline a formalisation of the argument scheme for statistical model selection, its critical questions and the structure of the knowledge base required to support the instantiation of the arguments and meta-level arguments through the use of Z notation. This paper also describes the prototype implementation of argumentation for statistical model selection based on the Z specification outlined herein. (shrink)

We provide a formal study of belief retraction operators that do not necessarily satisfy the postulate. Our intuition is that a rational description of belief change must do justice to cases in which dropping a belief can lead to the inclusion, or ‘liberation’, of others in an agent's corpus. We provide two models of liberation via retraction operators: ρ-liberation and linear liberation. We show that the class of ρ-liberation operators is included in the class of linear ones and provide axiomatic (...) characterisations for each class. We show how any retraction operator can be ‘converted’ into either a withdrawal operator ) or a revision operator via the Harper Identity and the Levi Identity respectively. (shrink)

This paper presents the past and present efforts of developing real-life applications of argumentation with the Gorgias preference-based structured argumentation framework of Logic Programming with Priorities. Since its free availability on the web in 2003, the Gorgias system has been used by different groups in a variety of real-life applications in areas such as medical support, network security, business computing, ambient intelligence and, recently, in the area of cognitive personal assistants. We briefly review the Gorgias framework and its past applications (...) and present an emerging general methodological approach for developing “decision making” applications of argumentation. This approach allows the development of real world applications directly from their high-level requirements expressed in the language of the application without the need for familiarity with the underlying technical details of argumentation. A new tool, called Gorgias-B, supports this high-level development of applications and automatically generates the underlying argumentation theory in Gorgias code. The paper also reports on ongoing real-life applications in two domains: an eye-clinic assistant for first level support, and systems for patient data access and data sharing agreements according to the relevant legislation and contracts or policies of the several stakeholders involved. The proposed approach is quite general for this type of applications of argumentation and, thus, it can be used with any preference-based argumentation framework. (shrink)

Darwiche and Pearl’s seminal 1997 article outlined a number of baseline principles for a logic of iterated belief revision. These principles, the DP postulates, have been supplemented in a number of alternative ways. Most suggestions have resulted in a form of ‘reductionism’ that identifies belief states with orderings of worlds. However, this position has recently been criticised as being unacceptably strong. Other proposals, such as the popular principle (P), aka ‘Independence’, characteristic of ‘admissible’ operators, remain commendably more modest. In this (...) paper, we supplement the DP postulates and (P) with a number of novel conditions. While the DP postulates constrain the relation between a prior and a posterior conditional belief set, our new principles notably govern the relation between two posterior conditional belief sets obtained from a common prior by different revisions. We show that operators from the resulting family, which subsumes both lexicographic and restrained revision, can be represented as relating belief states associated with a ‘proper ordinal interval’ (POI) assignment, a structure more fine-grained than a simple ordering of worlds. We close the paper by noting that these operators satisfy iterated versions of many AGM era postulates, including Superexpansion, that are not sound for admissible operators in general. (shrink)

We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy logics, we show how the idea of rational change from “crisp” base revision, as embodied by the idea of partial meet (base) revision, can be (...) faithfully extended to revising fuzzy belief bases. We present and axiomatise an operation of partial meet fuzzy base revision and illustrate how the operation works in several important special instances of the framework. We also axiomatise the related operation of partial meet fuzzy base contraction. (shrink)

In studies of multi-agent interaction, especially in game theory, the notion of equilibrium often plays a prominent role. A typical scenario for the belief merging problem is one in which several agents pool their beliefs together to form a consistent "group" picture of the world. The aim of this paper is to define and study new notions of equilibria in belief merging. To do so, we assume the agents arrive at consistency via the use of a social belief removal function, (...) in which each agent, using his own individual removal function, removes some belief from his stock of beliefs. We examine several notions of equilibria in this setting, assuming a general framework for individual belief removal due to Booth et al. We look at their inter-relations as well as prove their existence or otherwise. We also show how our equilibria can be seen as a generalisation of the idea of taking maximal consistent subsets of agents. (shrink)

Individuals high in depressive symptom severity show probability bias: they believe negative events are relatively probable, and positive events relatively improbable, compared to those with less severe symptoms. However, this has only ever been demonstrated using self-report measures, in which participants explicitly estimate events’ probabilities: this leaves open the risk that “probability bias” is merely an artefact of response bias. We tested the veracity of probability bias using an indirect behavioural measure, based on a sentence-reading task. Study 1 tested 112 (...) Turkish students; Study 2 tested 117 international users of online groups for people with depressive and anxiety disorders. As predicted, participants with higher depressive symptom scores responded relatively quickly to sentences stating negative events might occur, and relatively slowly to sentences stating positive events might occur, compared to those with lower scores. This effect was only marginal in Study 1, but reached significance in Study 2. However, contrary to predictions, this effect was not moderated by the probability level stated in the sentence. This makes our findings difficult to interpret, and we must present these studies as a failure to convincingly demonstrate depression-related probability bias. We hope this stimulates more work on the nature and veracity of probability bias. (shrink)

Upward monotonic semantics for necessity modals give rise to Ross’s Puzzle: they predict that □φ entails □(φ ∨ ψ), but common intuitions about arguments of this form suggest they are invalid. It is widely assumed that the intuitive judgments involved in Ross’s Puzzle can be explained in terms of the licensing of ‘Diversity’ inferences: from □(φ ∨ ψ), interpreters infer that the truth of each disjunct (φ, ψ) is compatible with the relevant set of worlds. I introduce two pieces of (...) data that this analysis fails to explain. Analyzing this data, I argue, suggests that necessity modals with embedded disjunctions license ‘Independence’ inferences: from the truth of □(φ ∨ ψ), interpreters infer that φ-without-ψ and ψ-without-φ are each compatible with the relevant set of worlds. I outline a bilateral inquisitive semantics for necessity modals that predicts the validity of the Independence inferences. I then argue that the resulting theory should be understood as one on which disjunctions denote pluralities of propositions, and necessity modals behave like collective predicates applied to these pluralities. (shrink)

The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing “if θ is true then, normally, φ is true” be said to follow from a given set of items of such information. Many answers to this question have been proposed but, surprisingly, virtually none have attempted any explicit connection to belief revision. The aim of this paper (...) is to give an example of how such a connection can be made by showing how the lexicographic closure of a set of defaults may be conceptualised as a process of iterated revision by sets of sentences. Specifically we use the revision method of Nayak. (shrink)

According to a simple theory of the relationship between 'want' ascriptions and the desires they ascribe, when I learn that ⌜A wants p⌝ is true, I learn that the truth of p is necessary and sufficient for satisfying one of A’s desires. I argue that this simple theory is false: ⌜A wants p⌝ can be true and underspecific: p may be necessary but not sufficient for the satisfaction of one of A’s desires. I show that existing semantics for 'want' cannot (...) account for this kind of underspecificity, and I propose a desire-based semantics for ‘want’ that can. I go on to argue that my semantics has empirical and methodological advantages over existing theories of ‘want’ that give truth conditions in terms of an agent’s preferential and doxastic state rather than their desires. -/- . (shrink)

Despite thinking that an appropriately nonanthropocentric approach to the more-than-human world requires understanding phenomena to be ontologically basic, Karen Barad engages with phenomenology only fleetingly. Here, I suggest that Barad ought to take Maurice Merleau-Ponty’s phenomenology more seriously for two reasons. First, Barad’s objections to his prospects for a suitably nonanthropocentric phenomenology rely upon a misdirected charge of representationalism. Second, Merleau-Ponty offers theoretical and methodological tools corrective to our tendencies toward metaphysical and behavioral colonialism which align with Barad’s project, yet, (...) insofar as her agential realism remains committed to a very strong metaphysical naturalism, appear unavailable to her. (shrink)

Actor‐Network Theory is a research lens that has gained popularity in the nursing and health sciences domains. The perspective allows a researcher to describe the interaction of actors (both human and non‐human) within networked sociomaterial contexts, including complex practice environments where nurses and health technology operate. This study will describe Actor‐Network Theory and provide methodological considerations for researchers who are interested in using this sociotechnical lens within nursing and informatics‐related research. Considerations related to technology conceptualization, levels of analysis, and sampling (...) procedures in Actor‐Network Theory based research are addressed. Finally, implications for future nursing research within complex environments are highlighted. (shrink)

In recent years many eco-phenomenological philosophers have argued that a more positive analysis of one’s relationship with more-than-human nature can be achieved through taking up Maurice Merleau-Ponty’s ontology of the flesh. Taking such an ontology seriously seems to facilitate even the possibility of our being able to express “what the world means to say.” I argue, however, that we should be cautious about both taking up such an ontology and making such ontological claims because in doing so we fail to (...) take sufficiently seriously the impact of sedimentation in both perception and reflection and thus violate the remit of radical reflection that is essential to Merleau-Ponty’s characterization of philosophy. (shrink)

In this paper we present a modal logic framework to reason about the expertise of information sources. A source is considered an expert on a proposition φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document} if they are able to correctly refute φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document} in any possible world where φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document} is false. Closely connected with expertise is a notion of (...) soundness of information: φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document} is said to be “sound” if it is true up to lack of expertise of the source. That is, any statement logically weaker than φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document} on which the source has expertise must in fact be true. This is relevant for modelling situations in which sources make claims beyond their domain of expertise. Particular attention is paid to the connection between expertise and knowledge: we show that expertise and soundness admit precise interpretations in terms of S4 and S5 epistemic logic, under certain conditions. We go on to extend the framework to multiple sources, defining two notions of collective expertise. These also have epistemic interpretations via distributed and common knowledge from multi-agent epistemic logic. On the technical side, we give several sound and complete axiomatisations of various classes of expertise models. (shrink)

Recent work has considered the problem of extending to the case of iterated belief change the so-called `Harper Identity' (HI), which defines single-shot contraction in terms of single-shot revision. The present paper considers the prospects of providing a similar extension of the Levi Identity (LI), in which the direction of definition runs the other way. We restrict our attention here to the three classic iterated revision operators--natural, restrained and lexicographic, for which we provide here the first collective characterisation in the (...) literature, under the appellation of `elementary' operators. We consider two prima facie plausible ways of extending (LI). The first proposal involves the use of the rational closure operator to offer a `reductive' account of iterated revision in terms of iterated contraction. The second, which doesn't commit to reductionism, was put forward some years ago by Nayak et al. We establish that, for elementary revision operators and under mild assumptions regarding contraction, Nayak's proposal is equivalent to a new set of postulates formalising the claim that contraction by ¬A should be considered to be a kind of `mild' revision by A. We then show that these, in turn, under slightly weaker assumptions, jointly amount to the conjunction of a pair of constraints on the extension of (HI) that were recently proposed in the literature. Finally, we consider the consequences of endorsing both suggestions and show that this would yield an identification of rational revision with natural revision. We close the paper by discussing the general prospects for defining iterated revision in terms of iterated contraction. (shrink)

Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for these operators, based on supplementing the plausibility ordering with a second, guiding, relation over the worlds was presented in Booth et al. (Artif Intell 174:1339-1368, 2010). However it is not always reasonable to assume completeness of the underlying ordering. In this paper we generalise the structure of Booth et al. (Artif Intell 174: 1339-1368, 2010) (...) to allow incomparabilities between worlds. We axiomatise the resulting class of belief removal functions, and show that it includes an important family of removal functions based on finite prioritised belief bases. (shrink)

Despite exerting considerable influence on other academic disciplines and mainstream environmental thought, object-oriented ontology has attracted little critical engagement from academic philosoph...

In this paper we present a brief overview of logic-based belief change, a research area concerned with the question of how a rational agent ought to change its mind in the face of new, possibly conflicting, information. Our intention is to provide the reader with a basic introduction to the work done in this area over the past 30 years. In doing so we hope to sketch the main historical results, provide appropriate pointers to further references, and discuss some current (...) developments. We trust that this will spur on the interested reader to learn more about the topic, and perhaps to join us in the further development of this exciting field of research. (shrink)

Archetypal medicine and past life therapy have received only scant attention in mainstream medical and psychological literature. Nonetheless, the epistemological and practice assumptions underlying Alfred Ziegler's model of archetypal medicine are highly congruent with those of past life therapy and both proffer salient alternatives to traditional reductionistic practice in psychotherapy and medicine. This paper explores the manner in which both seek to understand the meanings embedded in "health" and "illness" through a metaphorical interpretation of symptoms. Dualistic thinking gives way to (...) unitary consciousness as we begin to understand symptomatology in the larger scheme of a human being's entire lived experience. The transcendent, psychospiritual work of past life therapy is viewed in integrated partnership with archetypal medicine in healing the whole person rather than merely assessing symptoms in isolation and remediating them through mechanistic techniques and external applications of treatments. (shrink)