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)

We are concerned with showing how ‘labelled’ Natural Deduction presentation systems based on an extension of the so-called Curry-Howard functional interpretation can help us understand and generalise most of the deduction calculi designed to deal with the logical notion of existential quantification. We present the labelling mechanism for ‘’ using what we call ‘ɛ-terms’, which have the form of ‘a’) in a dual form to the ‘Ax.f’ terms of in the sense that the ‘witness’ is chosen at the time of (...) assertion/introduction.With the intention of demonstrating the generality of our framework, we provide a brief comparison with some other calculi of existentials, including the model-theoretic interpretations of Skolem and Herbrand, indicating the way in which some of the classical results on prenex normal forms can be extended to a wide range of logics. The essential ingredient is to look at the conceptual framework of labelled natural deduction as an attempted reconstruction of Frege's functional calculus where the devices of the Begriffsschrift work separately from, yet in harmony with, those of the Grundgesetze 1. (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)

Gabbay's separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In this paper, we establish an analogous statement a...

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)

In lieu of an abstract, here is a brief excerpt of the content:April 3, 2010 (11:17 am) C:\Users\Milt\Desktop\backup copy of Ken's G\WPData\TYPE2902\russell 29,2 050 red.wpd 1 Gabbay and Woods, eds., The Rise of Modern Logic from Leibniz to Frege, Vol. 3 of the Handbook of the History of Logic (Amsterdam, etc.: North-Holland, 2004). russell: the Journal of Bertrand Russell Studies n.s. 29 (winter 2009–10): 167–90 The Bertrand Russell Research Centre, McMaster U. issn 0036-01631; online 1913-8032 eviews BERTRAND RUSSELL IN (...) RECENT BOOKS ON LOGIC HISTORY Irving Anellis Peirce Edition / Indiana U.–Purdue U. Indianapolis, in 46202–5157, usa [email protected] Dov M. Gabbay and John Woods, eds. Logic from Russell to Church. Vol. 5 of The Handbook of the History of Logic. Amsterdam, etc.: North-Holland, 2009. Pp. xii + 1056. us$260; £157.99; ¤185.95. Leila Haaparanta, ed. The Development of Modern Logic. Oxford and New York: Oxford U. P., 2009. Pp. x + 904. us$150.00. The essay “Bertrand Russell’s Logic” by Andrew D. Irvine in Volume 5 of the Handbook of the History of Logic is one of the shortest in the volume (pp. 1–28). But something of Russell pervades many of the other essays as well, as we might expect given the centrality that Principia Mathematica has occupied in the historiography of logic through much of the twentieth century. This is especially evident in the lengthiest of the essays, Andrea Cantini’s “Paradoxes, Self-reference and Truth in the 20th Century” (pp. 875–1013), and more than tangentially in Dale Jacquette’s “Logic for Meinongian Object Theory Semantics” (pp. 29–76) and Michael Potter’s “The Logic of the Tractatusz” (pp. 255–304). In their preface, the editors of the Handbook explain (p. vii) the rationale for treating Frege and Russell in separate volumes.1 One reason is that it was a matter of simple conveniencez—zto keep the volume covering logic from Leibniz to Frege of manageable size. The other is historical: while admitting that Frege and Russell shared important goals and the philosophical position of logicism, it is noted that Frege’s most important work in logic and foundations was carried out prior to his learning of Russell’s paradox, whereas the entire corpus of Russell’s work, Principiaz included, was designed to a considerable extent in eTorts to deal with the paradox, as was much of the work in logic, set theory, and philosophy of logic that came as a consequence of the discovery of that paradox. Gabbay April 3, 2010 (11:17 am) C:\Users\Milt\Desktop\backup copy of Ken's G\WPData\TYPE2902\russell 29,2 050 red.wpd 168 Reviews and Woods also make explicit the philosophical diTerences between Frege and Russell regarding the epistemological status of axioms as one of the signiWcant diTerences between these two. More particularly, the editors assert (p. viii) that, in the very brief period between publication of the second volume of Frege’s Grundgesetze (1903) and Russell’s Principles of Mathematics (1903), there was a pronounced shift initiated in the goals of mathematical logic, away from naïve apriority of axiom systems, towards study of the limits and properties of formal systems.Thecontributors to these metalogical concerns, Herbrand, Hilbert, and Gödel, among others, are the subject of the bulk of the essays included in Volume 5 of the Handbook. The task that Irvine undertakes is initiated by the eTort to understand the unity of Russell’s technical body of work in mathematics, logic, metaphysics, and epistemology. Thus the discrepancy between the neo-Hegelian concept of relations, inherited from Bradley, with certain types of relationsz—zlogical, spatial, temporal, for examplez—zwith the mathematical understanding of relations, is given as the ground for Russell’s abandonment of idealism in favour of realism (pp. 4–5). For example, there is nothing inherent in two relata, say Abelard and Héloise, which contributes to the relation of love between the pair; rather, its root is found in the mental states of one or the other of the lovers, so that the relation itself is not an intrinsic property of one of the pair. Likewise, Russell reaches this position... (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)

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)

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).

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 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)

Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be reasoned about in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; it is not always possible to ‘α-convert a bound variable symbol’ or to ‘quotient by α-equivalence’; the notion of unifier is not based just on substitution.Permissive nominal terms closely resemble nominal terms but they recover these properties, and in (...) particular the ‘always fresh’ and ‘always rename’ properties. In the permissive world, freshness contexts are elided, equality is fixed, and the notion of unifier is based on substitution alone rather than on nominal terms’ notion of unification based on substitution plus extra freshness conditions.We prove that expressivity is not lost moving to the permissive case and provide an injection of nominal terms unification problems and their solutions into permissive nominal terms problems and their solutions.We investigate the relation between permissive nominal unification and higher-order pattern unification. We show how to translate permissive nominal unification problems and solutions in a sound, complete, and optimal manner, in suitable senses which we make formal. (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)

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)

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 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)

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 volume serves as a detailed introduction for those new to the field as well as a rich source of new insights and potential research agendas for those already engaged with the philosophy of economics.

We propose a family of Labelled Deductive Conditional Logic systems by defining a Labelled Deductive formalisation for the propositional conditional logics of normality proposed by Boutilier and Lamarre. By making use of the Compilation approach to Labelled Deductive Systems we define natural deduction rules for conditional logics and prove that our formalisation is a generalisation of the conditional logics of normality.

In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce three families of parameterised logics that arise from different ways of controlling the use of cut. We start with a formulation of classical logic in which cut is non-eliminable and then impose restrictions on the use of cut. Three Cut-and-Pay families of logics are presented, and it is shown that each family provides an (...) approximation process for full propositional classical logic when the control over the use of cut is progressively weakened. A sound and complete semantics is given for each component of each of the three families of approximated logics. One of these families is shown to possess the uniform substitution property, a new result for approximated reasoning. A tableau based decision procedure is presented for each element of the approximation families and the complexity of each decision procedure is studied. We show that there are families in which every component logic can be decided polynomially. (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)

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.

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)

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)

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)

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 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)

Product logic Π is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0,1], while Cancellative hoop logic CHL is a related logic with connectives interpreted as for Π but on the real unit interval with 0 removed (0,1]. Here we present several analytic proof systems for Π and CHL, including hypersequent calculi, co-NP labelled calculi and sequent calculi.

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 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)