Using Tableau to Decide Description Logics with Full Role Negation and Identity Renate A. Schmidt Dmitry Tishkovsky School of Computer Science, The Unive

Source URL: www.mettel-prover.org

Low-Dimensional Embeddings of Logic Tim Rockt¨aschel§ Matko Bosnjak§ Sameer Singh† Sebastian Riedel§ § Department of Computer Science, University College London, UK † Computer Science & Engineering, University o

Source URL: www.aclweb.org

• Logic
• Philosophy
• Reasoning
• Semantics
• Model theory
• Critical thinking
• Logical consequence
• Embedding
• Negation
• Inference
• Truth value
• Distributional semantics

MASTER’S THESIS Negation Detection in Medical Documents Using Syntactical Methods accomplished at the

Source URL: publik.tuwien.ac.at

Logical- and Meta-Logical Frameworks Lecture 1 Carsten Sch¨ urmann August 3, 2006

Source URL: www.itu.dk

• Logic in computer science
• Type theory
• Proof theory
• Classical logic
• Semantics
• Logical framework
• Propositional calculus
• Intuitionistic logic
• Negation
• Logic
• Mathematical logic
• Judgment

Using Tableau to Decide Description Logics with Full Role Negation and Identity RENATE A. SCHMIDT and DMITRY TISHKOVSKY, The University of Manchester, UK This paper presents a tableau approach for deciding expressive des

Source URL: www.cs.man.ac.uk

Modality and Negation in SIMT Use of Modality and Negation in Semantically-Informed Syntactic MT Kathryn Baker U.S. Dept. of Defense

Source URL: cs.jhu.edu

Negation Detection in Automated Medical Applications A Survey Stefan Gindl Vienna University of Technology

Source URL: publik.tuwien.ac.at

Rewriting Guarded Negation Queries Vince B´ar´any? , Michael Benedikt, and Balder ten Cate ?? 2 1 LogicBlox Inc., Atlanta, GA Department of Computer Science, University of Oxford

Source URL: developer.logicblox.com

• Logic
• Abstraction
• Mathematics
• Model theory
• Mathematical logic
• Craig interpolation
• First-order logic
• Conjunctive query
• Beth definability
• Substitution
• Interpretation
• Structure

P → ∃yRy ⊢ ∃y(P → Ry) I’ll prove the following claim: P → ∃yRy ⊢ ∃y(P → Ry) This is an unpleasant proof. I will prove the conclusion by assuming its negation

Source URL: logicmanual.philosophy.ox.ac.uk

Bridging the Gap Between Scope-based and Event-based Negation/Speculation Annotations: A Bridge Not Too Far Pontus Stenetorp1 Sampo Pyysalo2,3 Tomoko Ohta2,3 Sophia Ananiadou2,3 and Jun’ichi Tsujii2,3,4 1 Department of

Source URL: aclweb.org