2002 Journal of Software, )
|
|
- Kerry Chambers
- 5 years ago
- Views:
Transcription
1 /2002/13(04) Journal of Software Vol13 No4 ( ); ( ) hdstsysgn@cisezjueducn http//wwwzjueducn ; ; ; TP18 A ( ) (anaphora) 3 [1~3] GroszSidnerWalker Grosz Sidner PAL WalkerMA Grosz Sidner Focus Stack Cache ( ) ; ( ) (1974 ) ; (1959 )
2 733 [4] 1 A A { f = v f = v } T A = f n = v n n > 0 ; n Z f i v i f =v i f i v i A / A A T A' { A1 A 2 A n = } n > 0 ; n Z A i i=1 n (multiple-branched and multiple-labeled tree model MMT ) [5] MMT MMT MMT 9 [5] 2 21 LiYan-hui [6] (individuate) ( ) V L V n <W 1 W 2 W n > n W i V M L fw + n M W + n W i (i 1 n) W i M k k n W + n W j ={ } W j W i ={ }; a ={ }; a ={ }; ; ; ( 1 ) M 22
3 734 Journal of Software (4) [6] Ge Ju Zhong Duan Pian Ben Bu Sentence Speech Words Text Morpheme Word Paragraph Book Xie Fig1 Compositive habit between Chinese quantifier and meta_anaphoric symbol 23 EE 1 EE [7] EE Elementary Event EE EE EE EE EE EE EE tell_event( ) preposition_event( ) quote_event( ) EE EE EE EE EE EE 1 EE Condition Cause Conjunction( ) Content( ) Explanation( ) Disjunction( ) Reference( ) 3 EE EE EE 1 EE ; EE EE Content( ) Explanation( ) Disjunction( ) Reference( ) EE EE EE 3 (1) (2) 1 {( )+( )+( )+( )+
4 } 2 EE ( ) 3 EE 1 2 EE EE EE EE_CurrentFocus EE ; ( ); EE_CurrentFocus EE_OldFocusStack ( ) ; ( ) 4 EE 1~3 EE_CurrentFocus EE_OldFocusStack ( ) Word Word { 1 2} EE11 tell_event EE CurrentFocus( EE ) tell_event Theme( EE ) ThemeStack( Theme ) FocusStack( ) EE_CurrentFocus( ) 1 1 EE11 tell_event Content tell_event EE_OldFocusStack CurrentFocus tell_event;theme ;ThemeStack=NULL;FocusStack=NULL; EE_CurrentFocus=tell_event;EE_OldFocusStack= 1 EE111Word EE [7] Word EE111 tell_event 1 EE (condition) CurrentFocus=Word;Theme Word;ThemeStack= ;FocusStack=tell_event; EE_CurrentFocus=tell_event;EE_OldFocusStack= 1 EE112 EE it it EE CurrentFocus it EE112 EE CurrentFocus= ;Theme Word(it);ThemeStack=Word ;FocusStack=Word tell_event; EE_CurrentFocus=EE112;EE_OldFocusStack=tell_event 1 EE21 EE 2
5 736 Journal of Software (4) 3EE112 EE21 2 Conjunction 2 EE EE (condition) CurrentFocus= ;Theme ;ThemeStack=Word ;FocusStack= Word tell_event; EE_CurrentFocus=EE112;EE_OldFocusStack=tell_event 1 EE21 EE112 EE22Word EE 3 EE Sentence1 Sentence2 Condition Condition Cause Someone Condition Word EE11 Content EE111 Condition tell_event it Paragraph The speech Word Disjunction E EE21 Conjunction Mapping words EE22 It Expert 1 2 Fig2 The multiple-branched and multiple-labeled tree of example MMT Word CurrentFocus=Word;Theme Word; ThemeStack= Word ;FocusSta- ck= Word tell_event; EE22 EE21 Cause( )EE22 EE_CurrentFocus=EE22;EE_OldF ocusstack=ee112 tell_event EE11 MMT ( 2 ) ~ ~ (1) (2) (3) 3 General controlling module Input module Meta-Anaphora search module Meta-Anaphoric resolution module Statistic module Fig3 A raw drawing of the system 3 VisualC MMT MMT
6 737 MMT Table 1 Recognizability of Zi type of meta-anaphora 1 Meta-Anaphora (48 items) Non-Meta-Anaphora (70 items) Uncertainty (5 items) Items found by the algorithm Items match the criterian Recall factor (%) Pertinency factor (%) (48 ) (70 ) (5 ) ( ) 925% 89% % 71% % % % (+ ) (1) (2)
7 738 Journal of Software (4) 5 References [1] Grosz BJ Sidner CL Attentions intentions and the structure of discourse Computational Linguistics (3)175~204 [2] Grosz BJ Joshi AK Weinstein Scott Centering a framework for modeling the local coherence of discourse Computational Linguistics (2)203~225 [3] Huls C Claassen W Bos E Automatic referent resolution of deitic and anaphoric expressions Computational Linguistics (1)59~80 [4] Chen Zhi-qun FB-Model of Chinese discourse semantic representation Journal of Hangzhou University (Natural Science Edition) (Suppl)29~33 (in Chinese) [5] Feng Zhi-wei Natural Language Processing Shanghai Shanghai Foreign Language Teaching and Education Press 1996 (in Chinese) [6] Lu Bing-fu Analysing syntactic relation using semantics and pragmatics Journal of Chinese Philology ~367 (in Chinese) [7] Azzam S Humphreys K Gaizauskas R Evaluating a focus-based approach to anaphora resolution In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics Montreal Morgan Kaufmann Publishers Inc ~78 [4] FB ( )199825( )29~33 [5] 1996 [6] ~367 Study on Meta-Anaphoric Resolution in Chinese Discourse Understanding ZHANG Wei ZHOU Chang-le (Department of Computer Science and Engineering College of Information Science and Technology Zhejiang University Hangzhou China); (Institute of Artificial Intelligence Zhejiang University Hangzhou China) hdstsysgn@cisezjueducn http//wwwzjueducn Abstract Anaphoric resolution is a hot field in computational linguistics According to the research it is found that a kind of anaphora meta-anaphora which represents the form of sentence paragraph or discourse (not the subject or object of the sentence) plays an important role in discourse So meta-anaphoric resolution affects the computer s ability of discourse understanding This paper focuses on the meta-anaphoric resolution A new concept called Elementary Event focus (EE_focus) is introduced And some meta-anaphoric resolution algorithms based on the concept are designed The algorithms examined by a large Chinese natural language corpus The experimental results show that the EE_focus set can do good job in meta-anaphoric resolution The work enriches the theory of discourse s structural representation It is important in confirming the cohesion and coherence of the Chinese discourses Key words natural language understanding; Chinese text analysis; anaphoric resolution; meta-anaphora; EE_focus Received September ; accepted November Supported by the National Natural Science Foundation of China under Grant No
Discourse Structure and Co-Reference: An Empirical Study
Discourse Structure and Co-Reference: An Empirical Study Dan Cristea Department of Computer Science University A.I. Cuza Iaşi, România dcristea@infoiasi.ro Nancy Ide Department of Computer Science Vassar
More informationAn Empirical Investigation of the Relation Between Discourse Structure and Co-Reference
An Empirical Investigation of the Relation Between Discourse Structure and Co-Reference Dan Cristea University A.I. Cuza Iaşi, România dcristea@infoiasi.ro Nancy Ide Vassar College Poughkeepsie, NY, USA
More informationAutomatically Evaluating Text Coherence using Anaphora and Coreference Resolution
1 1 Barzilay 1) Automatically Evaluating Text Coherence using Anaphora and Coreference Resolution Ryu Iida 1 and Takenobu Tokunaga 1 We propose a metric for automatically evaluating discourse coherence
More informationSyntactic Patterns of Spatial Relations in Text
Syntactic Patterns of Spatial Relations in Text Shaonan Zhu, Xueying Zhang Key Laboratory of Virtual Geography Environment,Ministry of Education, Nanjing Normal University,Nanjing, China Abstract: Natural
More informationHidden Markov Models, I. Examples. Steven R. Dunbar. Toy Models. Standard Mathematical Models. Realistic Hidden Markov Models.
, I. Toy Markov, I. February 17, 2017 1 / 39 Outline, I. Toy Markov 1 Toy 2 3 Markov 2 / 39 , I. Toy Markov A good stack of examples, as large as possible, is indispensable for a thorough understanding
More informationTHE LOGIC OF QUANTIFIED STATEMENTS. Statements with Multiple Quantifiers. Statements with Multiple Quantifiers CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.3 Statements with Multiple Quantifiers Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. When a statement
More informationTask Oriented Dialog, Classic Models
Task Oriented Dialog, Classic Models Marilyn Walker. CS245. April 1 st, 2010 Natural Language and Dialogue Systems Lab Look at Syllabus Need to do sign ups for papers starting next week Will finish post
More informationThe Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple
The Formal Architecture of Lexical-Functional Grammar Ronald M. Kaplan and Mary Dalrymple Xerox Palo Alto Research Center 1. Kaplan and Dalrymple, ESSLLI 1995, Barcelona Architectural Issues Representation:
More informationThe Noisy Channel Model and Markov Models
1/24 The Noisy Channel Model and Markov Models Mark Johnson September 3, 2014 2/24 The big ideas The story so far: machine learning classifiers learn a function that maps a data item X to a label Y handle
More informationIntroduction to fuzzy logic
Introduction to fuzzy logic Andrea Bonarini Artificial Intelligence and Robotics Lab Department of Electronics and Information Politecnico di Milano E-mail: bonarini@elet.polimi.it URL:http://www.dei.polimi.it/people/bonarini
More informationYour web browser (Safari 7) is out of date. For more security, comfort and. the best experience on this site: Update your browser Ignore
Your web browser (Safari 7) is out of date. For more security, comfort and Activitydevelop the best experience on this site: Update your browser Ignore Places in the Park Why do we use symbols? Overview
More informationMathematics for linguists
Mathematics for linguists WS 2009/2010 University of Tübingen January 7, 2010 Gerhard Jäger Mathematics for linguists p. 1 Inferences and truth trees Inferences (with a finite set of premises; from now
More informationThe Application of P-Bar Theory in Transformation-Based Error-Driven Learning
The University of Southern Mississippi The Aquila Digital Community Master's Theses 12-2014 The Application of P-Bar Theory in Transformation-Based Error-Driven Learning Bryant Harold Walley University
More informationE-type interpretation without E-type pronoun: How Peirce s Graphs. capture the uniqueness implication of donkey sentences
E-type interpretation without E-type pronoun: How Peirce s Graphs capture the uniqueness implication of donkey sentences Author: He Chuansheng (PhD student of linguistics) The Hong Kong Polytechnic University
More informationa. ~p : if p is T, then ~p is F, and vice versa
Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.
More informationInference in Propositional Logic
Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located
More informationUncertain Logic with Multiple Predicates
Uncertain Logic with Multiple Predicates Kai Yao, Zixiong Peng Uncertainty Theory Laboratory, Department of Mathematical Sciences Tsinghua University, Beijing 100084, China yaok09@mails.tsinghua.edu.cn,
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationCOMP219: Artificial Intelligence. Lecture 20: Propositional Reasoning
COMP219: Artificial Intelligence Lecture 20: Propositional Reasoning 1 Overview Last time Logic for KR in general; Propositional Logic; Natural Deduction Today Entailment, satisfiability and validity Normal
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationOn solution of Klein-Gordon equation in scalar and vector potentials
On solution of Klein-Gordon equation in salar and vetor potentials Liu Changshi Physis division, Department of mehanial and eletrial engineering, Jiaxing College, Zhejiang, 314001, P. R. China Lius4976@sohu.om
More informationSection A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.
Math 299 Homework Assignment, Chapter 2 Section 2.1 2.A (not in the text) Which of the following are statements? Explain. 1. Let x be a positive integer. Then x is rational. 2. Mathematics is fun. 3. The
More informationCSE507. Introduction. Computer-Aided Reasoning for Software. Emina Torlak courses.cs.washington.edu/courses/cse507/17wi/
Computer-Aided Reasoning for Software CSE507 courses.cs.washington.edu/courses/cse507/17wi/ Introduction Emina Torlak emina@cs.washington.edu Today What is this course about? Course logistics Review of
More informationFinancial Informatics XI: Fuzzy Rule-based Systems
Financial Informatics XI: Fuzzy Rule-based Systems Khurshid Ahmad, Professor of Computer Science, Department of Computer Science Trinity College, Dublin-2, IRELAND November 19 th, 28. https://www.cs.tcd.ie/khurshid.ahmad/teaching.html
More informationTHE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form
More informationBar-Hillel and the Division of Labor in Language
Bar-Hillel and the Division of Labor in Language On the interaction of grammar, logic, and pragmatics Luka Crnič November 2, 2015 Language, Logic and Cognition Center http://scholars.huji.ac.il/llcc Luka
More informationMaking Method of the Data Processing System in the Experiment of. the Planck Constant Measuring with Photoelectric Effect
Making Method of the Data Processing System in the Experiment of the Planck Constant Measuring with Photoelectric Effect JIANG Xing-fang 1), LIYan-ji 1), JIANG Hong 2) 1)School of Mathematics & Physics,
More informationPropositional Logic and Semantics
Propositional Logic and Semantics English is naturally ambiguous. For example, consider the following employee (non)recommendations and their ambiguity in the English language: I can assure you that no
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationGrey prediction model-based men s 100m freestyle Olympic Games performance prediction research
Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2014, 6(6:2380-2385 Research Article ISSN : 0975-7384 CODEN(USA : JCPRC5 Grey prediction model-based men s Olympic Games
More informationDecision Procedures for Satisfiability and Validity in Propositional Logic
Decision Procedures for Satisfiability and Validity in Propositional Logic Meghdad Ghari Institute for Research in Fundamental Sciences (IPM) School of Mathematics-Isfahan Branch Logic Group http://math.ipm.ac.ir/isfahan/logic-group.htm
More informationProduction Inference, Nonmonotonicity and Abduction
Production Inference, Nonmonotonicity and Abduction Alexander Bochman Computer Science Department, Holon Academic Institute of Technology, Israel e-mail: bochmana@hait.ac.il Abstract We introduce a general
More informationPhilosophy 220. Truth-Functional Equivalence and Consistency
Philosophy 220 Truth-Functional Equivalence and Consistency Review Logical equivalency: The members of a pair of sentences [of natural language] are logically equivalent if and only if it is not [logically]
More informationCSE507. Course Introduction. Computer-Aided Reasoning for Software. Emina Torlak
Computer-Aided Reasoning for Software CSE507 courses.cs.washington.edu/courses/cse507/14au/ Course Introduction Emina Torlak emina@cs.washington.edu Today What is this course about? Course logistics Review
More informationSection Summary. Predicates Variables Quantifiers. Negating Quantifiers. Translating English to Logic Logic Programming (optional)
Predicate Logic 1 Section Summary Predicates Variables Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Logic Programming
More informationCSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Propositional Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Propositions A proposition is a declarative sentence that is either true or false
More informationLogical Agents. September 14, 2004
Logical Agents September 14, 2004 The aim of AI is to develop intelligent agents that can reason about actions and their effects and about the environment, create plans to achieve a goal, execute the plans,
More informationKnowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.
Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes
More informationSemantics and Pragmatics of NLP The Semantics of Discourse: Overview
university-logo Semantics and Pragmatics of NLP The Semantics of Discourse: Overview School of Informatics University of Edinburgh Outline university-logo 1 Anaphora across sentence boundaries 2 Changing
More informationDiscovering Classes of Strongly Equivalent Logic Programs with Negation as Failure in the Head
Discovering Classes of Strongly Equivalent Logic Programs with Negation as Failure in the Head Jianmin Ji School of Computer Science and Technology University of Science and Technology of China Hefei,
More informationLogic Background (1A) Young W. Lim 5/14/18
Young W. Lim Copyright (c) 2014 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationQuantification in the predicate calculus
Quantification in the predicate calculus PHIL 43916 eptember 5, 2012 1. The problem posed by quantified sentences... 1 2. yntax of PC... 2 3. Bound and free iables... 3 4. Models and assignments... 4 5.
More informationPropositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel
Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
More informationLINGO optimization model-based gymnastics team competition best starting line-up research
Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 0, 6(7):98-95 Research Article ISSN : 0975-738 CODEN(USA) : JCPRC5 LINGO optimization model-based gymnastics team competition
More informationSemantics and Pragmatics of NLP
Semantics and Pragmatics of NLP Alex Ewan School of Informatics University of Edinburgh 28 January 2008 1 2 3 Taking Stock We have: Introduced syntax and semantics for FOL plus lambdas. Represented FOL
More informationMapping the Baseline of Terrestrial Gamma Radiation in China
Radiation Environment and Medicine 2017 Vol.6, No.1 29 33 Note Mapping the Baseline of Terrestrial Gamma Radiation in China Zhen Yang, Weihai Zhuo* and Bo Chen Institute of Radiation Medicine, Fudan University,
More informationWord processing tools
Formal Report Length No longer than 1500 words (figures, tables and short captions do not count). The report should be based on the data you took in the lab and include all the major results obtained from
More informationGeotechnical Engineering Laboratory (CE 4348) Laboratory Report #1. Soil Classification. Group #1. Group member #1 Group member #2 Group member #3
Geotechnical Engineering Laboratory (CE 4348) Laboratory Report #1 Soil Classification Group #1 Group member #1 Group member #2 Group member #3 February 4, 2013 I have neither given nor received unauthorized
More informationUncertain Quadratic Minimum Spanning Tree Problem
Uncertain Quadratic Minimum Spanning Tree Problem Jian Zhou Xing He Ke Wang School of Management Shanghai University Shanghai 200444 China Email: zhou_jian hexing ke@shu.edu.cn Abstract The quadratic minimum
More informationPHIL12A Section answers, 16 February 2011
PHIL12A Section answers, 16 February 2011 Julian Jonker 1 How much do you know? 1. Show that the following sentences are equivalent. (a) (Ex 4.16) A B A and A B A B (A B) A A B T T T T T T T T T T T F
More informationFoundations of Natural Language Processing Lecture 5 More smoothing and the Noisy Channel Model
Foundations of Natural Language Processing Lecture 5 More smoothing and the Noisy Channel Model Alex Lascarides (Slides based on those from Alex Lascarides, Sharon Goldwater and Philipop Koehn) 30 January
More informationStudy on form distribution of soil iron in western Jilin and its correlation with soil properties
35 2 2016 6 GLOBAL GEOLOGY Vol. 35 No. 2 Jun. 2016 1004 5589 2016 02 0593 08 1 1 2 1 1 1. 130061 2. 130012 50 A > B > C > D > E > F > G A A CEC B ph C E A C D G B C D P595 S151. 9 A doi 10. 3969 /j. issn.
More informationIntroduction to Pragmatics
Introduction to Pragmatics Summer 2016 Tuesdays 2:30--4:00pm @ 2321.HS 3H INSTRUCTOR Todor Koev (Todor.Koev@uni-duesseldorf.de) Presupposition projection Presupposition is a prevalent type of inference
More informationEmpirical Methods in Natural Language Processing Lecture 10a More smoothing and the Noisy Channel Model
Empirical Methods in Natural Language Processing Lecture 10a More smoothing and the Noisy Channel Model (most slides from Sharon Goldwater; some adapted from Philipp Koehn) 5 October 2016 Nathan Schneider
More informationSelected Algorithms of Machine Learning from Examples
Fundamenta Informaticae 18 (1993), 193 207 Selected Algorithms of Machine Learning from Examples Jerzy W. GRZYMALA-BUSSE Department of Computer Science, University of Kansas Lawrence, KS 66045, U. S. A.
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationLogic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001
Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World
More informationAntecedents of counterfactuals violate de Morgan s law
Antecedents of counterfactuals violate de Morgan s law Lucas Champollion champollion@nyu.edu Joint work with Ivano Ciardelli and Linmin Zhang Fourth Workshop on Natural Language and Computer Science (NLCS
More informationCapturing Salience with a Trainable Cache Model for Zero-anaphora Resolution
Capturing Salience with a Trainable Cache Model for Zero-anaphora Resolution Ryu Iida Department of Computer Science Tokyo Institute of Technology 2-12-1, Ôokayama, Meguro, Tokyo 152-8552, Japan ryu-i@cl.cs.titech.ac.jp
More informationCurriculum Vitae Wenxiao Zhao
1 Personal Information Curriculum Vitae Wenxiao Zhao Wenxiao Zhao, Male PhD, Associate Professor with Key Laboratory of Systems and Control, Institute of Systems Science, Academy of Mathematics and Systems
More informationNonlinear Controller Design of the Inverted Pendulum System based on Extended State Observer Limin Du, Fucheng Cao
International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 015) Nonlinear Controller Design of the Inverted Pendulum System based on Extended State Observer Limin Du,
More informationInterpreting Low and High Order Rules: A Granular Computing Approach
Interpreting Low and High Order Rules: A Granular Computing Approach Yiyu Yao, Bing Zhou and Yaohua Chen Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail:
More informationPropositional Logic Logical Implication (4A) Young W. Lim 4/21/17
Propositional Logic Logical Implication (4A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation
More informationA Method of HVAC Process Object Identification Based on PSO
2017 3 45 313 doi 10.3969 j.issn.1673-7237.2017.03.004 a a b a. b. 201804 PID PID 2 TU831 A 1673-7237 2017 03-0019-05 A Method of HVAC Process Object Identification Based on PSO HOU Dan - lin a PAN Yi
More informationSupporting Information
Supporting Information Ultrasensitive Label-Free Resonance Rayleigh Scattering Aptasensor for Hg 2+ Using Hg 2+ -Triggered Exonuclease III-Assisted Target Recycling and Growth of G-Wires for Signal Amplification
More informationLing 130 Notes: Syntax and Semantics of Propositional Logic
Ling 130 Notes: Syntax and Semantics of Propositional Logic Sophia A. Malamud January 21, 2011 1 Preliminaries. Goals: Motivate propositional logic syntax and inferencing. Feel comfortable manipulating
More informationBreaking de Morgan s law in counterfactual antecedents
Breaking de Morgan s law in counterfactual antecedents Lucas Champollion New York University champollion@nyu.edu Ivano Ciardelli University of Amsterdam i.a.ciardelli@uva.nl Linmin Zhang New York University
More information11. Automata and languages, cellular automata, grammars, L-systems
11. Automata and languages, cellular automata, grammars, L-systems 11.1 Automata and languages Automaton (pl. automata): in computer science, a simple model of a machine or of other systems. ( a simplification
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationParsing. Probabilistic CFG (PCFG) Laura Kallmeyer. Winter 2017/18. Heinrich-Heine-Universität Düsseldorf 1 / 22
Parsing Probabilistic CFG (PCFG) Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Winter 2017/18 1 / 22 Table of contents 1 Introduction 2 PCFG 3 Inside and outside probability 4 Parsing Jurafsky
More informationLogical Inference. Artificial Intelligence. Topic 12. Reading: Russell and Norvig, Chapter 7, Section 5
rtificial Intelligence Topic 12 Logical Inference Reading: Russell and Norvig, Chapter 7, Section 5 c Cara MacNish. Includes material c S. Russell & P. Norvig 1995,2003 with permission. CITS4211 Logical
More informationLogic Background (1A) Young W. Lim 12/14/15
Young W. Lim 12/14/15 Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any
More information(6) Some students who drank beer or wine were allowed to drive.
Global Approach to Scalar Implicatures in Dynamic Semantics Jae-Il Yeom Hongik University English Language and Literature 94 Wausan-ro, Sangsu-dong, Mapo-gu Seoul 121-791 KOREA jiyeom@hongik.ac.kr Abstract
More informationSentence Planning 2: Aggregation
Pipelined Microplanning Sentence Planning 2: Aggregation Lecture 10 February 28, 2012 Reading: Chapter 5, Reiter and Dale Document Plan! Lexical choice! PPSs Aggregation PPSs Referring Expression Gen!
More informationA set theoretic view of the ISA hierarchy
Loughborough University Institutional Repository A set theoretic view of the ISA hierarchy This item was submitted to Loughborough University's Institutional Repository by the/an author. Citation: CHEUNG,
More informationExperimental Research of Optimal Die-forging Technological Schemes Based on Orthogonal Plan
Experimental Research of Optimal Die-forging Technological Schemes Based on Orthogonal Plan Jianhao Tan (Corresponding author) Electrical and Information Engineering College Hunan University Changsha 410082,
More informationPropositional Resolution Introduction
Propositional Resolution Introduction (Nilsson Book Handout) Professor Anita Wasilewska CSE 352 Artificial Intelligence Propositional Resolution Part 1 SYNTAX dictionary Literal any propositional VARIABLE
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationAn Effective Approach to Fuzzy Ontologies Alignment
, pp.73-82 http://dx.doi.org/10.14257/ijdta.2014.7.3.08 An Effective Approach to Fuzzy Ontologies Alignment Ling Qiu 1 and Yong Liu 2 1 School of Computer Science, Sichuan University of Science and Engineering
More information2 WANG Jue, CUI Jia et al. Vol.16 no", the discernibility matrix is only a new kind of learning method. Otherwise, we have to provide the specificatio
Vol.16 No.1 J. Comput. Sci. & Technol. Jan. 2001 Investigation on AQ11, ID3 and the Principle of Discernibility Matrix WANG Jue (Ξ ±), CUI Jia ( ) and ZHAO Kai (Π Λ) Institute of Automation, The Chinese
More informationGeometric and Quantum Methods for Information Retrieval
PAPER Geometric and Quantum Methods for Information Retrieval Yaoyong Li, Hamish Cunningham Department of Computer Science, University of Sheffield, Sheffield, UK {yaoyong;hamish}@dcs.shef.ac.uk Abstract
More informationIntroduction Introduction. Discrete Mathematics Andrei Bulatov
Introduction Introduction Discrete Mathematics Andrei Bulatov Discrete Mathematics - Introduction 1-2 Course Info Instructor: Andrei Bulatov Email: abulatov@sfu.ca Room: TASC 8013 Office hours (tentative):
More informationA Wavelet Neural Network Forecasting Model Based On ARIMA
A Wavelet Neural Network Forecasting Model Based On ARIMA Wang Bin*, Hao Wen-ning, Chen Gang, He Deng-chao, Feng Bo PLA University of Science &Technology Nanjing 210007, China e-mail:lgdwangbin@163.com
More informationIolanda Guevara Secondary Institut Badalona VII Carme Burgués Faculty of Education, University of BCN
Iolanda Guevara Secondary Institut Badalona VII Carme Burgués Faculty of Education, University of BCN 2012 NCTM: Annual Meeting & Exposition April 27, 2012 1 History of Mathematics and Education In this
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationEvaluation. Brian Thompson slides by Philipp Koehn. 25 September 2018
Evaluation Brian Thompson slides by Philipp Koehn 25 September 2018 Evaluation 1 How good is a given machine translation system? Hard problem, since many different translations acceptable semantic equivalence
More informationLecture 4: Proposition, Connectives and Truth Tables
Discrete Mathematics (II) Spring 2017 Lecture 4: Proposition, Connectives and Truth Tables Lecturer: Yi Li 1 Overview In last lecture, we give a brief introduction to mathematical logic and then redefine
More informationEvidential Paradigm and Intelligent Mathematical Text Processing
Evidential Paradigm and Intelligent Mathematical Text Processing Alexander Lyaletski 1, Anatoly Doroshenko 2, Andrei Paskevich 1,3, and Konstantin Verchinine 3 1 Taras Shevchenko Kiev National University,
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationUniversität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Language Models. Tobias Scheffer
Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen Language Models Tobias Scheffer Stochastic Language Models A stochastic language model is a probability distribution over words.
More informationFirst Order Logic Implication (4A) Young W. Lim 4/6/17
First Order Logic (4A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationLinguistic Quantifiers Modeled by Sugeno Integrals
Linguistic Quantifiers Modeled by Sugeno Integrals Mingsheng Ying State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing
More informationLogic - recap. So far, we have seen that: Logic is a language which can be used to describe:
Logic - recap So far, we have seen that: Logic is a language which can be used to describe: Statements about the real world The simplest pieces of data in an automatic processing system such as a computer
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.3 Statements with Multiple Quantifiers Copyright Cengage Learning. All rights reserved. Statements
More informationAdvanced Natural Language Processing Syntactic Parsing
Advanced Natural Language Processing Syntactic Parsing Alicia Ageno ageno@cs.upc.edu Universitat Politècnica de Catalunya NLP statistical parsing 1 Parsing Review Statistical Parsing SCFG Inside Algorithm
More informationSemantics and Pragmatics of NLP. SPNLP: Dynamic Semantics and Drawbacks
Semantics and Pragmatics of NLP Dynamic Semantics and Drawbacks School of Informatics University of Edinburgh Outline Some Quick Revision 1 Some Quick Revision 2 A quick overview of how DRSs are interpreted
More informationMining coreference relations between formulas and text using Wikipedia
Mining coreference relations between formulas and text using Wikipedia Minh Nghiem Quoc 1, Keisuke Yokoi 2, Yuichiroh Matsubayashi 3 Akiko Aizawa 1 2 3 1 Department of Informatics, The Graduate University
More information