BibSonomyburst/user/diego_ma/logicBibSonomy RSS feed for /user/diego_ma/logic2012-02-16T11:10:48+01:00http://www.bibsonomy.org/bibtex/222d964de109da0b8d35b3ca49fe1ef71/diego_madiego_ma2007-12-14T02:49:28+01:00logic linguistics <span class="authorEditorList"><a href="/author/van Benthem">Johan van Benthem</a>, and <a href="/author/ter Meulen">Alice ter Meulen</a> (Eds.). </span><em>Elsevier, </em><em>Amsterdam, </em>(<em>1997</em>)Fri Dec 14 02:49:28 CET 2007AmsterdamHandbook of Logic and LanguageHandbook of Logic and Language1997logic linguistics http://www.bibsonomy.org/bibtex/2874340941200b9df9767091999b0c1cf/diego_madiego_ma2007-12-14T02:48:14+01:00logic <span class="authorEditorList"><a href="/author/Wille">Rudolf Wille</a> </span><em>Proc. ICCS&#039;97, </em>(<em>1997</em>)Fri Dec 14 02:48:14 CET 2007Proc. ICCS'97Conceptual Graphs and Formal Concept Analysis1997logic It is shown how Conceptual Graphs and Formal Concept Analysis may be combined to obtain a formalization of Elementary Logic which is useful for knowledge representation and processing. For this, a translation of conceptual graphs to formal contexts and concept lattices is described through an example. Using a suitable mathematization of conceptual graphs, basics of a unified mathematical theory for Elementary Logic are proposed.http://www.bibsonomy.org/bibtex/26df0f2c563c819b0cfddbf6e0415b968/diego_madiego_ma2007-12-14T02:46:31+01:00logic <span class="authorEditorList"><a href="/author/Shanaham">Murray Shanaham</a> </span><em>MIT Press, </em><em>Cambridge, MA, </em>(<em>1997</em>)Fri Dec 14 02:46:31 CET 2007Cambridge, MASolving the Frame ProblemSolving the Frame Problem1997logic http://www.bibsonomy.org/bibtex/24a3ed337ae5b8a373287532a4a5b1182/diego_madiego_ma2007-12-14T02:45:17+01:00answer_extraction ambiguity logic <span class="authorEditorList"><a href="/author/Pratt-Hartmann">Ian Pratt-Hartmann</a> </span>(<em>August 1999</em>)<em>Draft for internal use only . </em>Fri Dec 14 02:45:17 CET 2007AugustDraft for internal use onlyInference Problems in {ExtrAns}: Quick Summary1999answer_extraction ambiguity logic http://www.bibsonomy.org/bibtex/21f7a09551f05f96b4f1020cc2a5a01c6/diego_madiego_ma2007-12-14T02:45:16+01:00ambiguity logic <span class="authorEditorList"><a href="/author/Pratt-Hartmann">Ian Pratt-Hartmann</a> </span>(<em>January 2000</em>)<em>Draft . </em>Fri Dec 14 02:45:16 CET 2007JanuaryDraftAn Ambiguous Logic2000ambiguity logic http://www.bibsonomy.org/bibtex/23949a92d86d7618e24afe4475ce674f2/diego_madiego_ma2007-12-14T02:43:30+01:00logic question_answering <span class="authorEditorList"><a href="/author/Moldovan">Dan Moldovan</a>, <a href="/author/Clark">Christine Clark</a>, <a href="/author/Harabagiu">Sanda Harabagiu</a>, and <a href="/author/Maiorano">Steve Maiorano</a> </span><em>Proc. HLT-NAACL 2003, </em><em>page 166-172. </em><em>Edmonton, </em>(<em>2003</em>)Fri Dec 14 02:43:30 CET 2007EdmontonProc. HLT-NAACL 2003166-172{COGEX}: A Logic Prover for Question Answering2003logic question_answering Recent TREC results have demonstrated the need for deeper text understanding methods. This paper introduces the idea of automated reasoning applied to question answering and shows the feasibility of integrating a logic prover into a Question Answering system. The approach is to transform questions and answer passages into logic representations. World knowledge axioms as well as linguistic axioms are supplied to the prover which renders a deep understanding of the relationship between question text and answer text. Moreover, the trace of the proofs provide answer justifications. The results show that the prover boosts the performance of the QA system on TREC questions by 30\%.http://www.bibsonomy.org/bibtex/265c646f1f4f9da82e59bb4fe0c21d83d/diego_madiego_ma2007-12-14T02:41:45+01:00logic <span class="authorEditorList"><a href="/author/Kowalski">Robert Kowalski</a> </span><em>The Computer Science Library, Artificial Intelligence Series </em><em>North Holland, </em><em>New York, Oxford, </em>(<em>1979</em>)Fri Dec 14 02:41:45 CET 2007New York, OxfordThe Computer Science Library, Artificial Intelligence SeriesLogic for Problem Solving71979logic http://www.bibsonomy.org/bibtex/2df0f6968a644569232e8f230aff987c2/diego_madiego_ma2007-12-14T02:41:44+01:00logic <span class="authorEditorList"><a href="/author/Kowalski">Robert Kowalski</a> </span><em>What is a Logical System?, </em><em>Oxford University Press, </em>(<em>1995</em>)Fri Dec 14 02:41:44 CET 2007What is a Logical System?Logic without Model Theory1995logic http://www.bibsonomy.org/bibtex/213aa892455ef9ee8e5c517679b4f835f/diego_madiego_ma2007-12-14T02:41:18+01:00logic <span class="authorEditorList"><a href="/author/Kalman">John A. Kalman</a> </span><em>Rinton Press, </em><em>Paramus, NJ, </em>(<em>2001</em>)Fri Dec 14 02:41:18 CET 2007Paramus, NJAutomated Reasoning with OTTER2001logic Automating reasoning has been described as ``one of the most exciting and potentially fruitful areas of research that there has ever been.'' This book provides you with the means: a powerful reasoning program called Otter, currently in use to answer diverse and deep questions in mathematics and logic. The volume presents an intriguing and thorough treatment of automated reasoning and Otter -- through numerous examples, exercises, and challenging questions. No background is needed. The early chapters lead you through Otter's fundamental operations and show you how to present questions and problems to Otter, beginning with simple puzzles. Numerous input files and proofs are provided, so you can experiment and play with problems. Gradually, more challenging applications are introduced, and more powerful strategies discussed -- strategies that are crucial to Otter's power and impressive list of successes.http://www.bibsonomy.org/bibtex/20980ffdcd2f500951a41509f27b9da4a/diego_madiego_ma2007-12-14T02:39:32+01:00question_answering logic <span class="authorEditorList"><a href="/author/Green">Cordell Green</a> </span><em>Machine Intelligence, </em><em> 4, </em><em>chapter 11, </em><em>Edinburgh University Press, </em>(<em>1969</em>)Fri Dec 14 02:39:32 CET 2007Machine Intelligence11183-205Theorem-Proving by Resolution as a Basis for Question-Answering Systems41969question_answering logic This paper shows how a question-answering system can be constructed using first-order logic as its language and a resolution-type theorem-prover as its deductive mechanism. A working computer program, QA3, based on these ideas is described. The performance of the program compares favorably with several other general question-answering systems.http://www.bibsonomy.org/bibtex/200235e82cf2dfe48c19c18ccdf1d6df2/diego_madiego_ma2007-12-14T02:39:14+01:00logic ambiguity <span class="authorEditorList"><a href="/author/Gardent">Claire Gardent</a>, and <a href="/author/Webber">Bonnie Webber</a> </span><em>CLAUS-113. </em><em>CoLi Saarbrücken, </em>(<em>February 2000</em>)Fri Dec 14 02:39:14 CET 2007FebruaryCLAUS-113Automated Reasoning and Discourse Disambiguation2000logic ambiguity The performance of first-order automated reasoning systems has been steadily improving, stimulated in part by the availability of test suites of mathematical problems on which the systems can be tested, tuned and compared. But discourse understanding in Natural Language poses different inference problems than mathematics. In order to tailor automated reasoning systems to the needs of Natural Language understanding, similar test suites need to be developed. In this paper, we claim that several kinds of ambiguity in discourse can be resolved through automated reasoning checks for consistency, informativity, and minimality. Future test suites should therefore include problems of these sorts. The overall goal then is to characterise the range of inference problems that discourse understanding gives rise to and that test suites should include.http://www.bibsonomy.org/bibtex/27ae38d908ea5e7f73c6c4192069a1896/diego_madiego_ma2007-12-14T02:38:50+01:00logic <span class="authorEditorList"><a href="/author/Flax">Lee Flax</a> </span><em>93-139C. </em><em>Macquarie University, </em>(<em>1993</em>)Fri Dec 14 02:38:50 CET 200793-139CApplication of the Hamming Distance Between Logical Formulae to Statistical Contingency Tables1993logic A metric can be defined between pairs of formulae of first order logic. The definition is based upon a given set of interpretations. The method is analogous to the definition of the Hamming distance between binary words, except that the role of bit position is played by a whole interpretation. (The Hamming distance between two binary words counts the number of bit positions at which the two words differ.) Using this metric, the connectives ``and'', ``or'' and ``not'' turn out to be uniformly continous functions. The above metric is also used to measure the truth of certain implications arising from statistical contingency tables.http://www.bibsonomy.org/bibtex/2d26f2af670588b3aab3c07dd37835058/diego_madiego_ma2007-12-14T02:37:27+01:00logic <span class="authorEditorList"><a href="/author/Clark">Keith L. Clark</a> </span><em>Logic and Data Bases, </em><em> 1, </em><em>Plenum Press, </em><em>New York, London, </em>(<em>1978</em>)Fri Dec 14 02:37:27 CET 2007New York, LondonLogic and Data Bases293-322Negation as failure11978logic http://www.bibsonomy.org/bibtex/2a3c500430521c25f5634c3f260d960b6/diego_madiego_ma2007-12-14T02:36:16+01:00computer linguistics logic <span class="authorEditorList"><a href="/author/Blackburn">Patrick Blackburn</a>, <a href="/author/Dymetman">Marc Dymetman</a>, <a href="/author/Lecomte">Alain Lecomte</a>, <a href="/author/Ranta">Aarne Ranta</a>, <a href="/author/Retoré">Christian Retoré</a>, and <a href="/author/de la Clergerie">Eric Villemonte de la Clergerie</a> </span><em>Logical Aspects of Computational Linguistics, First International Conference, LACL &#039;96, </em><em>volume 1328 of Lecture Notes in Computer Science, </em><em>page 1-20. </em><em>Springer, </em>(<em>1997</em>)Fri Dec 14 02:36:16 CET 2007Logical Aspects of Computational Linguistics, First International Conference, LACL '961-20Lecture Notes in Computer ScienceLogical Aspects of Computational Linguistics: an introduction13281997computer linguistics logic The papers in this collection are all devoted to single theme: logic and its application in computational linguistics. They share many themes, goals, and techniques, and any editorial classification is bound to highlight some connections at the expense of other. Nonetheless, we have found it useful to divide these papers (somewhat arbitrarily) into the following four categories: {\bf logical semantics of natural language}, {\bf grammar and logic},{\bf mathematics with linguistic motivations}, and {\bf computational perspectives}. In this introduction, we use this four-way classification as a guide to the papers, and, more generally, to the research agenda that underlies them. We hope that the reader will find it a useful starting point to the collection.http://www.bibsonomy.org/bibtex/2fc6cfd8b67b81d0e682c0c6c7bad06a2/diego_madiego_ma2007-12-14T02:36:15+01:00DRT logic <span class="authorEditorList"><a href="/author/Blackburn">Patrick Blackburn</a>, <a href="/author/Bos">Johan Bos</a>, and <a href="/author/Kohlhase">Michael Kohlhase</a> </span>(<em>1999</em>)<em>Draft of the paper at the Third International Tbilisi Symposium . </em>Fri Dec 14 02:36:15 CET 2007Draft of the paper at the Third International Tbilisi SymposiumAutomated Reasoning for Computational Semantics1999DRT logic http://www.bibsonomy.org/bibtex/283aae3c3263e8248ceb7bb175ceccf52/diego_madiego_ma2007-12-14T02:35:04+01:00logic <span class="authorEditorList"><a href="/author/Gamut">L. T. F. Gamut</a> </span><em>The University of Chicago Press, </em>(<em>1991</em>)Fri Dec 14 02:35:04 CET 2007Logic, Language, and Meaning1991logic