
416Abductive reasoning in neuralsymbolic systemsTopoi 26 (1): 3749. 2007.Abduction is or subsumes a process of inference. It entertains possible hypotheses and it chooses hypotheses for further scrutiny. There is a large literature on various aspects of nonsymbolic, subconscious abduction. There is also a very active research community working on the symbolic (logical) characterisation of abduction, which typically treats it as a form of hypotheticodeductive reasoning. In this paper we start to bridge the gap between the symbolic and subsymbolic approaches to abdu…Read more

376Analysis of the Talmudic Argumentum A Fortiori Inference Rule using Matrix AbductionStudia Logica 92 (3): 281364. 2009.We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of nondeductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix 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…Read more

140Advice on Abductive LogicLogic Journal of the IGPL 14 (2): 189219. 2006.One of our purposes here is to expose something of the elementary logical structure of abductive reasoning, and to do so in a way that helps orient theorists to the various tasks that a logic of abduction should concern itself with. We are mindful of criticisms that have been levelled against the very idea of a logic of abduction; so we think it prudent to proceed with a certain diffidence. That our own account of abduction is itself abductive is methodological expression of this diffidence. A s…Read more

123Handbook of the History of Logic (edited book)Elsevier. 2004.Greek, Indian and Arabic Logic marks the initial appearance of the multivolume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, The Emergence of Classical Logic, Logic and the Modalities in the Twentieth Century, and The ManyValued and NonMonotonic Turn in Logic. Further volumes will follow, includ…Read more

116A theory of hypermodal logics: Mode shifting in modal logic (review)Journal of Philosophical Logic 31 (3): 211243. 2002.A hypermodality is a connective □ whose meaning depends on where in the formula it occurs. The paper motivates the notion and shows that hypermodal logics are much more expressive than traditional modal logics. In fact we show that logics with very simple K hypermodalities are not complete for any neighbourhood frames

109Direct deductive computation on discourse representation structuresLinguistics and Philosophy 17 (4). 1994.

100Roadmap for preferential logicsJournal of Applied NonClassical Logics 19 (1): 4395. 2009.We give a systematic overview of semantical and logical rules in non monotonic and related logics. We show connections and sometimes subtle differences, and also compare such rules to uses of the notion of size.

90Independence — Revision and DefaultsStudia Logica 92 (3): 381394. 2009.We investigate different aspects of independence here, in the context of theory revision, generalizing slightly work by Chopra, Parikh, and Rodrigues, and in the context of preferential reasoning.

88A logical account of formal argumentationStudia Logica 93 (23): 109145. 2009.In the current paper, we reexamine 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 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

76Combining Temporal Logic SystemsNotre Dame Journal of Formal Logic 37 (2): 204232. 1996.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 onedimensional temporal logics to the resulting combined twodimensional 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…Read more

75Adding a temporal dimension to a logic systemJournal of Logic, Language and Information 1 (3): 203233. 1992.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, …Read more

75Fuzzy logics based on [0,1)continuous uninormsArchive for Mathematical Logic 46 (56): 425449. 2007.Axiomatizations are presented for fuzzy logics characterized by uninorms continuous on the halfopen real unit interval [0,1), generalizing the continuous tnorm based approach of Hájek. Basic uninorm logic BUL is defined and completeness is established with respect to algebras with lattice reduct [0,1] whose monoid operations are uninorms continuous on [0,1). Several extensions of BUL are also introduced. In particular, Cross ratio logic CRL, is shown to be complete with respect to one special …Read more

68Sequential Dynamic LogicJournal of Logic, Language and Information 21 (3): 279298. 2012.We introduce a substructural propositional calculus of Sequential Dynamic Logic that subsumes a propositional part of dynamic predicate logic, and is shown to be expressively equivalent to propositional dynamic logic. Completeness of the calculus with respect to the intended relational semantics is established.

65Contextdependent Abduction and RelevanceJournal of Philosophical Logic 35 (1): 6581. 2006.Based on the premise that what is relevant, consistent, or true may change from context to context, a formal framework of relevance and context is proposed in which • contexts are mathematical entities • each context has its own language with relevant implication • the languages of distinct contexts are connected by embeddings • intercontext deduction is supported by bridge rules • databases are sets of formulae tagged with deductive histories and the contexts they belong to • abduction and rev…Read more

63Cut and payJournal of Logic, Language and Information 15 (3): 195218. 2006.In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cutrule 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 noneliminable and then impose restrictions on the use of cut. Three CutandPay families of logics are presented, and it is shown that each family provides an approx…Read more

62An irreflexivity lemma with applications to axiomatizations of conditions on tense framesIn U. Mönnich (ed.), Aspects of Philosophical Logic, Dordrecht. pp. 6789. 1981.

59A general theory of structured consequence relationsTheoria 10 (2): 4978. 1995.There are several areas in logic where the monotonicity of the consequence relation fails to hold. Roughly these are the traditional nonmonotonic systems arising in Artificial Intelligence (such as defeasible logics, circumscription, defaults, ete), numerical nonmonotonic systems (probabilistic systems, fuzzy logics, belief functions), resource logics (also called substructural logics such as relevance logic, linear logic, Lambek calculus), and the logic of theory change (also called belief re…Read more

59A Comment on Work by Booth and CoauthorsStudia Logica 94 (3): 403432. 2010.Booth and his coauthors have shown in [2], that many new approaches to theory revision (with fixed K ) can be represented by two relations, , where is a subrelation of < . They have, however, left open a characterization of the infinite case, which we treat here.

57Reactive preferential structures and nonmonotonic consequenceReview of Symbolic Logic 2 (2): 414450. 2009.We introduce Information Bearing Relation Systems (IBRS) as an abstraction of many logical systems. These are networks with arrows recursively leading to other arrows etc. We then define a general semantics for IBRS, and show that a special case of IBRS generalizes in a very natural way preferential semantics and solves open representation problems for weak logical systems. This is possible, as we can the strong coherence properties of preferential structures by higher arrows, that is, arrows, w…Read more

57ManyDimensional Modal Logics: Theory and Applications (edited book)Elsevier North Holland. 2003.Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a…Read more

55Obligations and prohibitions in Talmudic deontic logicArtificial Intelligence and Law 19 (23): 117148. 2011.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 f…Read more

55Two dimensional Standard Deontic Logic [including a detailed analysis of the 1985 Jones–Pörn deontic logic system]Synthese 187 (2): 623660. 2012.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 ContrarytoDuties (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 i…Read more

53Handbook of Philosophical Logic (edited book)Kluwer Academic Publishers. 1989.The first edition of the Handbook of Philosophical Logic (four volumes) was published in the period 19831989 and has proven to be an invaluable reference work ...

53Analytic Calculi for Product LogicsArchive for Mathematical Logic 43 (7): 859889. 2004.Product logic Π is an important tnorm 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, coNP labelled calculi and sequent calculi.

52Semantics for Higher Level Attacks in Extended Argumentation Frames Part 1: OverviewStudia Logica 93 (23). 2009.In 2005 the author introduced networks which allow attacks on attacks of any level. So if a → b reads a attacks 6, then this attack can itself be attacked by another node c. This attack itself can attack another node d. This situation can be iterated to any level with attacks and nodes attacking other attacks and other nodes. In this paper we provide semantics (of extensions) to such networks. We offer three different approaches to obtaining semantics. 1. The translation approach This uses the m…Read more

51What is a Logical System? (edited book)Oxford University Press. 1994.This superb collection of papers focuses on a fundamental question in logic and computation: What is a logical system? With contributions from leading researchersincluding Ian Hacking, Robert Kowalski, Jim Lambek, Neil Tennent, Arnon Avron, L. Farinas del Cerro, Kosta Dosen, and Solomon Fefermanthe book presents a wide range of views on how to answer such a question, reflecting current, mainstream approaches to logic and its applications. Written to appeal to a diverse audience of readers, W…Read more

51Resourceorigins of NonmonotonicityStudia Logica 88 (1): 85112. 2008.Formal nonmonotonic systems try to model the phenomenon that common sense reasoners are able to “jump” in their reasoning from assumptions Δ to conclusions C without their being any deductive chain from Δ to C. Such jumps are done by various mechanisms which are strongly dependent on context and knowledge of how the actual world functions. Our aim is to motivate these jump rules as inference rules designed to optimise survival in an environment with scant resources of effort and time. We begin w…Read more

50Uncertainty Rules in Talmudic ReasoningHistory and Philosophy of Logic 32 (1): 6369. 2011.The Babylonian Talmud, compiled from the 2nd to 7th centuries C.E., is the primary source for all subsequent Jewish laws. It is not written in apodeictic style, but rather as a discursive record of (real or imagined) legal (and other) arguments crossing a wide range of technical topics. Thus, it is not a simple matter to infer general methodological principles underlying the Talmudic approach to legal reasoning. Nevertheless, in this article, we propose a general principle that we believe helps …Read more