See also:

AIML & Prolog | AIML 2013 | Deep Inference 2015 | Machine Reading

**On the pigeonhole and related principles in deep inference and monotone systems** A Das – Proceedings of the Joint Meeting of the Twenty-Third …, 2014 – dl.acm.org Abstract We construct quasipolynomial-size proofs of the propositional pigeonhole principle in the deep inference system KS, addressing an open problem raised in previous works and matching the best known upper bound for the more general class of monotone proofs. Cited by 5 Related articles All 50 versions

**A deep inference system with a self-dual binder which is complete for linear lambda calculus** L Roversi – Journal of Logic and Computation, 2014 – Oxford Univ Press Abstract We recall that SBV, a proof system developed under the methodology of deep inference, extends multiplicative linear logic with the self-dual non-commutative logical operator Seq. We introduce SBVB that extends SBV by adding the self-dual binder Sdb on … Cited by 4 Related articles All 3 versions

**A logical basis for quantum evolution and entanglement** RF Blute, A Guglielmi, IT Ivanov, P Panangaden… – Categories and Types in …, 2014 – Springer … In our logical interpretation, edges are assigned logical formulas in a special logical system, called BV, an instance of a deep inference system. … Thus enters the new system of logics which go under the general name deep inference. … Cited by 11 Related articles All 60 versions

**From display calculi to deep nested sequent calculi: Formalised for full intuitionistic linear logic** JE Dawson, R Clouston, R Goré, A Tiu – Theoretical Computer Science, 2014 – Springer … be developed by the following methodology: define a sound and complete display calculus for an extension of the logic with additional adjunctions; translate this calculus to a shallow inference nested sequent calculus; translate this calculus to a deep inference nested sequent … Cited by 3 Related articles All 8 versions

**Extraction of rules dependencies for optimization of backward inference algorithm** R Simi?ski – Beyond Databases, Architectures, and Structures, 2014 – Springer … 3 Decision Units Decision units originally came into existence as a tool for global and local rule knowledge base verification. This approach is devoted to knowledge bases, in which there are rules that probably create deep inference path. … Cited by 6 Related articles All 3 versions

**The Commutative/Noncommutative Linear Logic BV** A Guglielmi – 2014 – cs.bath.ac.uk … can handle. On the other hand, the proof-theoretic methodology needed for BV, which we call deep inference, benefits all the other logics, so I will survey some of the main results that deep inference makes possible. The formal … Cited by 1 Related articles

**Symmetric normalisation for intuitionistic logic** N Guenot, L Straßburger – Proceedings of the Joint Meeting of the …, 2014 – dl.acm.org … The first is a direct adaptation of the standard sequent calculus to the deep inference setting, and we describe a procedure for cut elimination, similar to the one from the sequent calculus, but using a non-local rewriting. The … Cited by 1 Related articles All 48 versions

**Application of DNA barcoding to the identification of Hymenoptera parasitoids from the soybean aphid (Aphis glycines) in China** QS Zhou, YQ Xi, F Yu, X Zhang, XJ Li, CL Liu… – Insect …, 2014 – Wiley Online Library … When blasted in GenBank database, seven species returned close matches for 28S and COI, respectively. Another four species had no matching sequences in both BOLD and NCBI. A deep inference of species delimitation. … Cited by 5 Related articles All 6 versions

**Equality and fixpoints in the calculus of structures** K Chaudhuri, N Guenot – Proceedings of the Joint Meeting of the Twenty …, 2014 – dl.acm.org … We propose in this paper an extension of the calculus of structures, a deep inference formalism, that supports incremental and contextual reasoning with equality and fixpoints in the setting of linear logic. This system allows deductive … Cited by 1 Related articles All 45 versions

**Introduction to Deep Inference** A Guglielmi – 2014 – cs.bath.ac.uk This talk is available at http://cs.bath.ac.uk/ag/t/IDI.pdf Deep inference web site: http://alessio.guglielmi .name/res/cos/ … Normalisation Phase 1: Reduction of cut to atomic form … Substructural example: The noncommutative linear logic BV … It’s the free composition of proofs via the … Related articles

**A Subatomic Proof System** A Guglielmi – 2014 – cs.bath.ac.uk … but if we only look for proofs of normal formulae, we only get normal proofs with the usual (deep inference) proof theory. Is it interesting? … AaC? ? ?BaD? ???? A ? B] a [C ? D] This scheme is typical of logical rules in deep inference! Page 7. … Related articles

**Introducing Substitution in Proof Theory** A Guglielmi – 2014 – cs.bath.ac.uk … Open deduction: composition by (1) connectives and (2) inference rules. ? It exists [5] and it can be taken as a definition for deep inference. … This talk is available at http://cs.bath.ac.uk/ag/ t/ISPT.pdf Deep inference web site: http://alessio.guglielmi.name/res/cos/ Page 20. … Related articles

**A Subatomic Proof System** AA Tubella, A Guglielmi – a? a – cs.bath.ac.uk … In deep inference 4,6 those two objections are easily overcome, because, given any proof in a Gentzen system, every contraction and cut instances can be locally transformed into their atomic variants by a local procedure of polynomial-size complexity 2 . We shall not define … Related articles All 4 versions

**Fully Automated Non-rigid Segmentation with Distance Regularized Level Set Evolution Initialized and Constrained by Deep-structured Inference** TA Ngo, G Carneiro – Computer Vision and Pattern …, 2014 – ieeexplore.ieee.org … The first step of our approach is to use structured deep inference to detect the region of interest (ROI) containing the visual object and then run a simple and fast segmenta- tion approach that will produce the initial segmentation for the distance regularized level set method … Related articles All 6 versions

**Case, Constructions, FrameNet, and the Deep Lexicon** JR Hobbs – ACL 2014, 2014 – aclweb.org … I will discuss how case re- lates to lexical decompositions, how moti- vated constructions span the borderline be- tween syntax and semantics, and how the frames of FrameNet provide an excellent first step in deep inference. 1 Deep Lexical Semantics … Related articles All 8 versions

**Deep Generative and Discriminative Models for Speech Recognition** L Deng – wissap.iiit.ac.in Page 1. Deep Generative and Discriminative Models for Speech Recognition Li Deng deng@microsoft.com Microsoft Research, Redmond, WA 98052 WiSSAP-2014 Lecture (Janury 17-20) Page 2. Main References • Li Deng … Related articles

**Linear logic model of state revisited** V De Paiva – Logic Journal of IGPL, 2014 – Oxford Univ Press Page 1. Linear logic model of state revisited VALERIA DE PAIVA ? , Nuance Communications, Sunnyvale, CA 94085, USA Abstract In an unpublished note Reddy introduced an extended intuitionistic linear calculus, called LLMS … Related articles All 4 versions

**Analysis and survey on tri-electrode sounding of consequent fault in Dumu open pit mine** LS Chang, L Pan, M Zhang – Transit Development in Rock …, 2014 – books.google.com … reflected clearly. It concluded the reflection of low resistance belt as known structure in the deep, inference of fault structural angle of F100 is 52 by WT2 profile, inference of structural angle is 53 by WT1 and WT3 profiles. 14th … Related articles All 2 versions

**Applying Language Technologies on Healthcare Patient Records for Better Treatment of Bulgarian Diabetic Patients** I Nikolova, D Tcharaktchiev, S Boytcheva… – Artificial Intelligence: …, 2014 – Springer … Applying Language Technologies on Healthcare Patient Records 93 Intelligence task so IE is proposed as a technology at the middle between keyword search and deep text analysis; it focuses on surface linguistic phenomena that can be recognised without deep inference. … Related articles All 4 versions

**Interaction and depth against nondeterminism in proof search** O Kahramanogullari – arXiv preprint arXiv:1403.2628, 2014 – arxiv.org … Abstract. Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions. Deep … Cited by 4 Related articles All 13 versions

**Implicational Rewriting Tactics in HOL** V Aravantinos, S Tahar – Interactive Theorem Proving, 2014 – Springer Page 1. Implicational Rewriting Tactics in HOL Vincent Aravantinos 1 and Sofiène Tahar 2 1 Software & Systems Engineering, Fortiss GmbH, Guerickestraße 25, 80805, Munich, Germany vincent.aravantinos@fortiss.org http … Related articles All 4 versions

**Embedding the hypersequent calculus in the display calculus** R Ramanayake – Journal of Logic and Computation, 2014 – Oxford Univ Press Page 1. [13:10 18/10/2014 exu061.tex] LogCom: Journal of Logic and Computation Page: 1 1–22 Embedding the hypersequent calculus in the display calculus REVANTHA RAMANAYAKE, Institute of Computer Languages, Vienna … Cited by 2 Related articles All 2 versions

**A proof-theoretic view on scheduling in concurrency** E Beffara – arXiv preprint arXiv:1402.6459, 2014 – arxiv.org … Bruscoli establishes a correspondence between proof search in a variant of MLL and execution of a minimal CCS, in a context of deep-inference [7]. Although our translation of processes into formulas is different that that used by the above works, connections can certainly be … Cited by 2 Related articles All 18 versions

**A propositional system induced by Japaridze’s approach to IF logic** W Xu – Logic Journal of IGPL, 2014 – Oxford Univ Press … As will be seen shortly, the inference rules of our system IFp modify cirquents at any level rather than only around the root. Thus, IFp is in fact a deep inference system, in the style of [1]. This explains our borrowing some notation from the Calculus of Structures. … Cited by 2 Related articles All 4 versions

**Minimal type inference for Linked Data consumers** G Ciobanu, R Horne, V Sassone – … of Logical and Algebraic Methods in …, 2014 – Elsevier We provide an introduction to the Web of Linked Data from the perspective of a Web developer who would like to build an application using Linked Data. We identi. Related articles

**Herbrand’s Fundamental Theorem: The Historical Facts and their Streamlining** CP Wirth – arXiv preprint arXiv:1405.6317, 2014 – arxiv.org Page 1. arXiv:1405.6317v2 [math.LO] 14 Aug 2014 SEKI 2009 Herbrand’s Fundamental Theorem: The Historical Facts and their Streamlining Claus-Peter Wirth FB AI, Hochschule Harz, 38855Wernigerode, Germany wirth@logic.at SEKI Report SR–2014–01 SE K I R eport … Related articles All 2 versions

**Clausal Resolution for Modal Logics of Confluence** C Nalon, J Marcos, C Dixon – Automated Reasoning, 2014 – Springer Page 1. Clausal Resolution for Modal Logics of Confluence Cláudia Nalon 1,?, Jo˜ao Marcos 2,??, and Clare Dixon 3 1 Departament of Computer Science, University of Bras?lia CP 4466 – CEP:70.910-090 – Bras?lia – DF – Brazil nalon@unb.br 2 LoLITA and Dept. … Cited by 1 Related articles All 5 versions

**Type Similarity for the Lambek-Grishin Calculus Revisited** A Bastenhof – Categories and Types in Logic, Language, and Physics, 2014 – Springer … context. Our notation comes close to Brünnler and McKinley’s use of deep inference for intuitionistic logic [1]. Contrary to their concept of derivability, however, our inference steps need not be restricted to primitive arrows. We … Related articles All 3 versions

**Hypersequent and Display Calculi–a Unified Perspective** A Ciabattoni, R Ramanayake, H Wansing – Studia Logica, 2014 – Springer Page 1. Studia Logica DOI: 10.1007/s11225-014-9566-z © Springer Science+Business Media Dordrecht 2014 Agata Ciabattoni Revantha Ramanayake Heinrich Wansing Hypersequent and Display Calculi – a Unified Perspective Abstract. … Cited by 5 Related articles All 5 versions

**Metabolic free energy and biological codes: a ‘Data Rate Theorem’ aging model** R Wallace – Bulletin of mathematical biology, 2014 – Springer … That is, R(D) is always a reverse J-shaped curve. This will prove crucial for the overall argument. Indeed, convexity is an exceedingly powerful mathematical condi- tion and permits deep inference (eg, Rockafellar 1970). Ellis (1985, Ch. … Cited by 2 Related articles All 7 versions

**Multi-type display calculus for propositional dynamic logic** S Frittella, G Greco, A Kurz… – Journal of Logic and …, 2014 – appliedlogictudelft.nl Page 1. Multi-type display calculus for Propositional Dynamic Logic Sabine Frittella? Giuseppe Greco† Alexander Kurz‡ Alessandra Palmigiano§ Abstract We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). … Cited by 9 Related articles All 6 versions

**A logical calculus for controlled monotonicity** M D’Agostino, M Piazza, G Pulcini – Journal of Applied Logic, 2014 – Elsevier In this paper we introduce a new deductive framework for analyzing processes displaying a kind of controlled monotonicity. In particular, we prove the cut-elimi. Cited by 2 Related articles All 4 versions

Agata Ciabattoni Revantha Ramanayake Heinrich Wansing **Hypersequent and display calculi – a unified perspective** Abstract. This paper presents an overview of the methods of hypersequents and display sequents in the proof theory of non-classical logics. … Related articles All 6 versions

**Label-free Modular Systems for Classical and Intuitionistic Modal Logics** S Marin, L Straßburger – Advances in Modal Logic 10, 2014 – hal.inria.fr Page 1. Label-free Modular Systems for Classical and Intuitionistic Modal Logics Sonia Marin, Lutz Straßburger To cite this version: Sonia Marin, Lutz Straßburger. Label-free Modular Systems for Classical and Intuition- istic Modal Logics. … Cited by 8 Related articles All 55 versions

**Multi-type display calculus for Propositional Dynamic Logic** SFG Greco, AKA Palmigiano – appliedlogictudelft.nl Page 1. Multi-type display calculus for Propositional Dynamic Logic Sabine Frittella Giuseppe Greco Alexander Kurz Alessandra Palmigiano? Abstract We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). … Related articles

**A Proof-Theoretic Semantic Analysis of Dynamic Epistemic Logic** SFGG AlexanderKurz, A Palmigiano, V Sikimi? – 2014 – appliedlogictudelft.nl Page 1. A Proof-Theoretic Semantic Analysis of Dynamic Epistemic Logic SabineFrittella GiuseppeGreco AlexanderKurz Alessandra Palmigiano? Vlasta Sikimi? 24th September 2014 Abstract The present paper provides an … Related articles

**Nested sequents for intuitionistic logics** M Fitting – Notre Dame Journal of Formal Logic, 2014 – projecteuclid.org Page 1. Notre Dame Journal of Formal Logic Volume 55, Number 1, 2014 Nested Sequents for Intuitionistic Logics Melvin Fitting Abstract Relatively recently nested sequent systems for modal logics have come to be seen as … Cited by 7 Related articles All 5 versions

**A cirquent calculus system with clustering and ranking** W Xu – arXiv preprint arXiv:1409.3290, 2014 – arxiv.org … As will be seen shortly, the inference rules of RIFp modify cirquents at any level rather than only around the root. Thus, RIFp is in fact a deep inference system, in the style of [1]. This explains our borrowing some notation from the Calculus of Structures. … Related articles All 2 versions

**A multi-type display calculus for dynamic epistemic logic** S Frittella, G Greco, A Kurz… – Journal of Logic and …, 2014 – appliedlogictudelft.nl Page 1. Multi-type Display Calculus for Dynamic Epistemic Logic Sabine Frittella? Giuseppe Greco† Alexander Kurz‡ Alessandra Palmigiano§ Vlasta Sikimic¶ October 24, 2014 Abstract In the present paper, we introduce a … Cited by 9 Related articles All 5 versions

**Clausal resolution for modal logics of confluence–extended version** C Nalon, J Marcos, C Dixon – 2014 – 138.253.184.233 Page 1. Clausal Resolution for Modal Logics of Confluence – Extended Version ? Cláudia Nalon1†, Jo˜ao Marcos2‡, and Clare Dixon3 1 Departament of Computer Science, University of Bras?lia CP 4466 – CEP:70.910-090 … Cited by 1 Related articles All 5 versions

**A Survey of Nonstandard Sequent Calculi** A Indrzejczak – Studia Logica, 2014 – Springer Page 1. Studia Logica DOI: 10.1007/s11225-014-9567-y © The Author(s) 2014. This article is published with open access at Springerlink.com Andrzej Indrzejczak A Survey of Nonstandard Sequent Calculi Abstract. The paper … Cited by 1 Related articles All 4 versions

**The implications of interactive eBooks on comprehension** SK Frye – 2014 – rucore.libraries.rutgers.edu Page 1. Running Head: INTERACTIVE EBOOKS AND COMPREHENSION THE IMPLICATIONS OF INTERACTIVE EBOOKS ON COMPREHENSION By SHEILA K. FRYE A dissertation submitted to The Graduate School of Education Rutgers, The State University of New Jersey … Cited by 2 Related articles All 2 versions

Dipartimento di Informatica M ALDINUCCI, LR ANSELMA, RR ARINGHIERI… – Inf. Comput, 2014 – di.unito.it …** A deep inference system with a self-dual binder which is complete for linear lambda calculus**, Journal of Logic and Computation, 2014. … Linear Lambda Calculus and Deep Inference, TLCA 2011 – 10th Typed Lambda Calculi and Applications, Part of RDP’11, ARCoSS/LNCS. … Cited by 4 Related articles All 2 versions

**A proof-theoretic semantic analysis of dynamic epistemic logic** S Frittella, G Greco, A Kurz… – Journal of Logic and …, 2014 – Oxford Univ Press Page 1. [17:21 13/5/2015 exu063.tex] LogCom: Journal of Logic and Computation Page: 1 1–55 Substructural Logics A proof-theoretic semantic analysis of dynamic epistemic logic SABINE FRITTELLA, Laboratoire d’Informatique … Cited by 9 Related articles All 6 versions

**Verb Semantics for Natural Language Understanding** D Wijaya – cs.cmu.edu … There is a need there- fore to map the lexical semantic resources to knowledge bases containing conceptual representation of the world to facilitate deep inference over the data for better natural language understanding (Soderland et al., 2010). 4 Proposed Approach … Related articles All 2 versions

**A Theory of Model Equivalence** O Kahramanogullar?, JF Lynch – We thank all the contributors for …, 2014 – openpub.fmach.it … O. Kahramanogullar? and J. Lynch. Stochastic flux analysis of chemical reaction networks. BMC Systems Biology, 7 (133), 2013. O. Kahramanogullar?. Nondeterminism and Language Design in Deep Inference. PhD thesis, TU Dresden, 2006. 153 Page 154. … Related articles All 3 versions

**Proof identity for mere mortals** J Alama – arXiv preprint arXiv:1403.0641, 2014 – arxiv.org … Page 10. 6. Gonthier, G.: Formal proof—The four-color theorem. Notices of the American Mathematical Society 55(11), 1382–1393 (2008) 7. Guglielmi, A.: The problem of bureaucracy and identity of proofs from the perspective of deep inference. … Related articles All 2 versions

**Space & Congruence Compression of Proofs** A Fellner – emcl-study.eu … For First Order Logic Cut-Introduction has been studied [32], which is a form of proof compression. Deep Inference [16] combines a number of approaches to formulate new proof systems, which can represent proofs much more succinctly than traditional systems. … Related articles All 2 versions

**A note on Frobenius monoidal functors on autonomous categories** A Balan – arXiv preprint arXiv:1407.1012, 2014 – arxiv.org Page 1. arXiv:1407.1012v1 [math.CT] 3 Jul 2014 A note on Frobenius monoidal functors on autonomous categories Adriana Balan ?†‡ July 4, 2014 Abstract Frobenius monoidal functors preserve duals. We show that conversely … Related articles All 3 versions