From - Tue Jan 21 09:42:29 2003 Path: acsu.buffalo.edu!not-for-mail From: "William J. Rapaport" Newsgroups: sunyab.cse.563 Subject: WELCOME Date: Wed, 15 Jan 2003 11:26:01 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 29 Sender: rapaport@buffalo.edu Message-ID: <3E258B99.2070205@cse.buffalo.edu> NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Trace: prometheus.acsu.buffalo.edu 1042647983 15839 128.205.34.3 (15 Jan 2003 16:26:23 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 15 Jan 2003 16:26:23 +0000 (UTC) User-Agent: Mozilla/5.0 (X11; U; SunOS sun4u; en-US; rv:1.0.1) Gecko/20020920 Netscape/7.0 X-Accept-Language: en-us, en Xref: acsu.buffalo.edu sunyab.cse.563:1 Welcome to the CSE 463/563 newsgroup for Spring 2003. Please check this newsgroup on a daily basis for updates to class announcements, news of updates to the syllabus or directory of documents, and general discussion. Please feel free to post news or queries! If you have a query but are too embarrassed to post it, send me email and if I think it's of general interest, I will hide your identity and post the query and a reply to the newsgroup. -- ------------------------------------------------------------------------- William J. Rapaport Associate Professor of Computer Science & Adjunct Professor of Philosophy Member, Center for Cognitive Science Associate Director, SNePS Research Group (SNeRG) 201 Bell Hall (office: 214 Bell) | 716-645-3180 x 112 Dept. of Computer Science & Engineering | fax: 716-645-3464 University at Buffalo (SUNY) | rapaport@cse.buffalo.edu Buffalo, NY 14260-2000 | ------------------------------------------------------------------------- CSE: www.cse.buffalo.edu/ homepage: www.cse.buffalo.edu/~rapaport/ SNeRG: www.cse.buffalo.edu/sneps/ Buffalo Restaurant Guide: www.cse.buffalo.edu/restaurant.guide/ Cognitive Science: wings.buffalo.edu/cogsci/ From - Tue Jan 21 09:42:58 2003 Path: acsu.buffalo.edu!not-for-mail From: "William J. Rapaport" Newsgroups: sunyab.cse.563 Subject: Project 1 for students who have already done it in another course Date: Wed, 15 Jan 2003 16:42:54 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 28 Sender: rapaport@buffalo.edu Message-ID: <3E25D5DD.A5FD4CA5@cse.buffalo.edu> NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Trace: prometheus.acsu.buffalo.edu 1042666987 17255 128.205.34.3 (15 Jan 2003 21:43:07 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 15 Jan 2003 21:43:07 +0000 (UTC) X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.563:2 Some of you have already done Project 1 for another course with me. If so, you have several options, depending on how much of the SNePS Tutorial you have already done. If you have only done "Project 1" of the Tutorial, then please do "Project 2". If you have already done "Project 2", then please *create* an interesting "Project 3", and do it! -- ------------------------------------------------------------------------- William J. Rapaport Associate Professor of Computer Science & Adjunct Professor of Philosophy Member, Center for Cognitive Science Associate Director, SNePS Research Group (SNeRG) 201 Bell Hall (office: 214 Bell) | 716-645-3180 x 112 Dept. of Computer Science & Engineering | fax: 716-645-3464 University at Buffalo (SUNY) | rapaport@cse.buffalo.edu Buffalo, NY 14260-2000 | ------------------------------------------------------------------------- CSE: www.cse.buffalo.edu/ homepage: www.cse.buffalo.edu/~rapaport/ SNeRG: www.cse.buffalo.edu/sneps/ Buffalo Restaurant Guide: www.cse.buffalo.edu/restaurant.guide/ Cognitive Science: wings.buffalo.edu/cogsci/ From - Tue Jan 21 09:43:33 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SYLLABUS UPDATE Date: Wed, 15 Jan 2003 16:58:53 -0500 (EST) Organization: Computer Science and Engineering Lines: 4 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042667933 29726 128.205.34.3 (15 Jan 2003 21:58:53 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 15 Jan 2003 21:58:53 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:3 The syllabus has been updated to include Paul Gestwicki's office (Trailer B-11). http://www.cse.buffalo.edu/~rapaport/563/syl.html#staff From - Tue Jan 21 09:43:40 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: SNePS package for Dia Date: Wed, 15 Jan 2003 17:52:13 -0500 Organization: The University at Buffalo Lines: 40 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1042671148 12684 128.205.35.2 (15 Jan 2003 22:52:28 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 15 Jan 2003 22:52:28 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:4 Dia is an open-source drawing program that I use on my GNU/Linux system. Looking over the downloads page, it looks like there's a Microsoft Windows port as well. The Dia project homepage is here: http://www.lysator.liu.se/~alla/dia/ When I tried making SNePS diagrams using Dia, I quickly became frustrated with manually putting text labels inside of circles to make nodes. I wrote a simple SNePS package for Dia, and it is available for download. If you are using Dia on *nix, download http://www.cse.buffalo.edu/~pvg/dia-SNePS-linux.jar and extract it in your home directory. It will write all the needed files into your .dia directory, so that when you start up Dia, the SNePS package will be available. You can download an archive that contains just the data files here: http://www.cse.buffalo.edu/~pvg/dia-SNePS.jar This archive file contains just the three files needed by my simple SNePS package: SNePS.sheet, node.shape, and node.xpm. You can then install these manually based on your Dia installation and environment. If you have any questions, feel free to email me. The SNePS package is quite simple and small, so if you are feeling adventurous and make any augmentations to it, please make the new files available so that we can all benefit. -Paul From - Tue Jan 21 09:43:49 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.740,sunyab.cse.563 Subject: SAVING SNePS DEMOS Date: Thu, 16 Jan 2003 08:54:20 -0500 (EST) Organization: Computer Science and Engineering Lines: 63 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042725260 27775 128.205.34.3 (16 Jan 2003 13:54:20 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 16 Jan 2003 13:54:20 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.740:2 sunyab.cse.563:5 A student writes: > I'm having a difficult time figuring out how to save my demo for the > tutorial. I have been working my way through it, but I'm worried that > I'll lose my work. I don't understand what you mean by mpage, its an > application I am unfamiliar with, and unable to find any posted > material on. First, re-read Section 1.2, which offers advice on how to create, save, and run SNePS demos. You can also use the "script" facility on Unix. "script" will save a copy of your entire screen interaction to a file, which you can then print. To run "script", do the following: 1. At the Unix prompt, type "script" followed by the name of a file that will contain the copy of your screen interaction: >script myfile 2. Unix will print a message and give you a new prompt: Script started, file is myfile > 3. Then run lisp, SNePS, and your demo. 4. When you are finished, exit SNePS, exit lisp, and you will return to the Unix prompt. 5. At that prompt, type "exit"; this will end your "script", print a message, and give you a new Unix prompt: > exit exit Script done, file is myfile > 6. You can then print "myfile". As for "mpage", it's a way to format a file for printing so that you save paper. To find out more about it (or any other Unix command, for that matter), type "man mpage" at a Unix prompt (or "man COMMAND", where COMMAND is the comman you want to find out more about). The easiest way to use "mpage" is to have it format your file for 2-column output, which puts two full-sized pages onto one side of a piece of paper, side by side. There's one small catch: "mpage" sometimes truncates long lines. To avoid that, use the command "fold". Here's how to put it all together: >fold myfile | mpage -2 | lpr Here's what that does: * "fold" ensures that long lines in "myfile" are not truncated. * the output of "fold myfile" is sent to the "mpage" program, which formats it to put 2 pages on one page (that's what the "-2" does) * the output of "mpage -2" is then printed (using the "lpr" command; you might need to add "-Pprinter" to send it to your favorite printer). From - Tue Jan 21 09:43:56 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SYLLABUS UPDATE Date: Thu, 16 Jan 2003 15:35:02 -0500 (EST) Organization: Computer Science and Engineering Lines: 5 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042749302 14813 128.205.34.3 (16 Jan 2003 20:35:02 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 16 Jan 2003 20:35:02 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:6 I have added a new link on the syllabus to a page containing recommended readings from the recommended texts. http://www.cse.buffalo.edu/~rapaport/563/syl.html#texts http://www.cse.buffalo.edu/~rapaport/563/rec.rdgs.html From - Tue Jan 21 09:44:03 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: AI-RELATED RESEARCH GROUP MEETINGS Date: Fri, 17 Jan 2003 09:08:46 -0500 (EST) Organization: Computer Science and Engineering Lines: 28 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042812526 20971 128.205.34.3 (17 Jan 2003 14:08:46 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 17 Jan 2003 14:08:46 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:7 sunyab.cse.740:5 There are several AI-related research groups that are relevant to both CSE 563 and CSE 740, which you might like to attend. For all of them, please feel free to come late or leave early, if necessary. And feel free to just be silent observers; there's no obligation to participate. SNePS Research Group (SNeRG): Wednesdays, 12 noon-1:50 p.m., Bell 224 webpage: http://www.cse.buffalo.edu/sneps/ schedule: http://www.cse.buffalo.edu/sneps/Schedules/spring03.html to join the mailing list: mailto:rapaport@cse.buffalo.edu Center for Cognitive Science: Wednesdays, 2:00 p.m.-4:00 p.m., Park 280 webpage: http://wings.buffalo.edu/cogsci/ schedule: http://wings.buffalo.edu/cogsci/html/2003spring.htm to join the mailing lists: http://wings.buffalo.edu/cogsci/Misc/mailing.lists.htm Contextual Vocabulary Acquisition: Thursdays, 12 noon-2:00 p.m., Baldy 17 webpage: http://www.cse.buffalo.edu/~rapaport/cva.html to join the mailing list: mailto:rapaport@cse.buffalo.edu From - Tue Jan 21 09:44:10 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: RAPAPORT'S OFFICE HOURS Date: Fri, 17 Jan 2003 11:47:11 -0500 (EST) Organization: Computer Science and Engineering Lines: 25 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042822031 10628 128.205.34.3 (17 Jan 2003 16:47:11 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 17 Jan 2003 16:47:11 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:8 sunyab.cse.740:6 ------------------------------------------------------------------------- Subject: RAPAPORT'S OFFICE HOURS ------------------------------------------------------------------------- My office hours this semester will be: Tuesdays & Fridays, 2:00 p.m-3:00 p.m., or by appointment. I will adjust the syllabus to reflect this. ------------------------------------------------------------------------- William J. Rapaport Associate Professor of Computer Science & Adjunct Professor of Philosophy Member, Center for Cognitive Science Associate Director, SNePS Research Group (SNeRG) 201 Bell Hall (office: 214 Bell) | 716-645-3180 x 112 Dept. of Computer Science & Engineering | fax: 716-645-3464 University at Buffalo (SUNY) | rapaport@cse.buffalo.edu Buffalo, NY 14260-2000 | ------------------------------------------------------------------------- CSE: www.cse.buffalo.edu/ homepage: www.cse.buffalo.edu/~rapaport/ SNeRG: www.cse.buffalo.edu/sneps/ Buffalo Restaurant Guide: www.cse.buffalo.edu/restaurant.guide/ Cognitive Science: wings.buffalo.edu/cogsci/ From - Tue Jan 21 09:44:16 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: Peirce's logic Date: Tue, 21 Jan 2003 09:30:09 -0500 (EST) Organization: Computer Science and Engineering Lines: 26 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043159409 23098 128.205.34.3 (21 Jan 2003 14:30:09 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 21 Jan 2003 14:30:09 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:9 Prof. Randall Dipert of the UB Philosophy Dept will be giving an informal presentation on the logical system developed by the 19th-century American philosopher Charles Sanders Peirce. One aspect of Peirce's system was developed by the 20th-century computer scientist John Sowa (author of one of our recommended texts) into his semantic network knowledge representation system "Conceptual Graphs". Here's more info on Dipert's talk, which some of you might find of interest; it is certainly relevant to our course: ------------------------------------------------------------------------- Date: Tue, 21 Jan 2003 08:24:00 -0500 From: Randall Dipert Subject: Talk on Peirce's Logic; Query on arguments To: PHIFAC-L@LISTSERV.BUFFALO.EDU Feb 28 (Tuesday), 11-12:50 in Park 280, I'll be giving a self-contained talk on Peirce's Logic in the context of my seminar on Peirce. Main topics will be his modifications to Boole's logic, the theory of relations, his co-discovery of quantifiers and especially, his diagrammatic logic for the first-order predicate logic (the Beta Existential Graphs) and its motivations. The Existential Graphs in particular have attracted much attention in cognitive science (John Sowa; Jon Barwise and students). This talk will be suitable for someone who knows nothing about Peirce and little about logic. From - Tue Jan 21 09:48:21 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SYLLABUS UPDATE Date: Wed, 15 Jan 2003 16:58:53 -0500 (EST) Organization: Computer Science and Engineering Lines: 4 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042667933 29726 128.205.34.3 (15 Jan 2003 21:58:53 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 15 Jan 2003 21:58:53 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:3 The syllabus has been updated to include Paul Gestwicki's office (Trailer B-11). http://www.cse.buffalo.edu/~rapaport/563/syl.html#staff From - Tue Jan 21 09:48:44 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SYLLABUS UPDATE Date: Thu, 16 Jan 2003 15:35:02 -0500 (EST) Organization: Computer Science and Engineering Lines: 5 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042749302 14813 128.205.34.3 (16 Jan 2003 20:35:02 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 16 Jan 2003 20:35:02 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:6 I have added a new link on the syllabus to a page containing recommended readings from the recommended texts. http://www.cse.buffalo.edu/~rapaport/563/syl.html#texts http://www.cse.buffalo.edu/~rapaport/563/rec.rdgs.html From - Tue Jan 21 09:49:08 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: AI-RELATED RESEARCH GROUP MEETINGS Date: Fri, 17 Jan 2003 09:08:46 -0500 (EST) Organization: Computer Science and Engineering Lines: 28 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042812526 20971 128.205.34.3 (17 Jan 2003 14:08:46 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 17 Jan 2003 14:08:46 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:7 sunyab.cse.740:5 There are several AI-related research groups that are relevant to both CSE 563 and CSE 740, which you might like to attend. For all of them, please feel free to come late or leave early, if necessary. And feel free to just be silent observers; there's no obligation to participate. SNePS Research Group (SNeRG): Wednesdays, 12 noon-1:50 p.m., Bell 224 webpage: http://www.cse.buffalo.edu/sneps/ schedule: http://www.cse.buffalo.edu/sneps/Schedules/spring03.html to join the mailing list: mailto:rapaport@cse.buffalo.edu Center for Cognitive Science: Wednesdays, 2:00 p.m.-4:00 p.m., Park 280 webpage: http://wings.buffalo.edu/cogsci/ schedule: http://wings.buffalo.edu/cogsci/html/2003spring.htm to join the mailing lists: http://wings.buffalo.edu/cogsci/Misc/mailing.lists.htm Contextual Vocabulary Acquisition: Thursdays, 12 noon-2:00 p.m., Baldy 17 webpage: http://www.cse.buffalo.edu/~rapaport/cva.html to join the mailing list: mailto:rapaport@cse.buffalo.edu From - Tue Jan 21 09:49:54 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SYLLABUS UPDATE Date: Thu, 16 Jan 2003 15:35:02 -0500 (EST) Organization: Computer Science and Engineering Lines: 5 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1042749302 14813 128.205.34.3 (16 Jan 2003 20:35:02 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 16 Jan 2003 20:35:02 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:6 I have added a new link on the syllabus to a page containing recommended readings from the recommended texts. http://www.cse.buffalo.edu/~rapaport/563/syl.html#texts http://www.cse.buffalo.edu/~rapaport/563/rec.rdgs.html From - Wed Jan 22 08:51:04 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: "Considerations Regarding Human-Level AI" Date: Tue, 21 Jan 2003 11:04:12 -0500 (EST) Organization: Computer Science and Engineering Lines: 32 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043165052 1061 128.205.34.3 (21 Jan 2003 16:04:12 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 21 Jan 2003 16:04:12 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:10 ------------------------------------------------------------------------- Subject: "Considerations Regarding Human-Level AI" ------------------------------------------------------------------------- The following Stanford University colloquium announcement is very relevant to KR; Nilsson is one of the early AI & KR pioneers, and the author of the first AI text. I urge you to read his essay (there's a link to the postscript version below). ========================================================================= SSP Forum: Nils Nilsson on Jan 16, 2003 at 04:15 PM Event Location: 380-380C (Math Corner) http://www.robotics.stanford.edu/users/nilsson/bio.html Posted on Jan 6, 2003. Last updated on Jan 6, 2003 by Heather Pon-Barry . Event Description: Considerations Regarding Human-Level Artificial Intelligence AI researchers have several overlapping objectives. Among these are: to build systems that aid humans in intellectual tasks; to build agents that can function autonomously in circumscribed domains; to build a general science of intelligence as manifested in animals, humans, and machines; and to build versatile agents with human-level intelligence or beyond. Some considerations regarding human-level AI are described in my essay available at: http://www.robotics.stanford.edu/users/nilsson/hlai.ps. Participants in this SSP Forum will be encouraged to discuss with the author the claims made in the essay. From - Wed Jan 22 08:51:32 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: GENERAL RESOURCES ON KNOWLEDGE REPRESENTATION AND REASONING Date: Tue, 21 Jan 2003 11:38:30 -0500 (EST) Organization: Computer Science and Engineering Lines: 8 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043167110 4150 128.205.34.3 (21 Jan 2003 16:38:30 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 21 Jan 2003 16:38:30 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:11 ------------------------------------------------------------------------- Subject: GENERAL RESOURCES ON KNOWLEDGE REPRESENTATION AND REASONING ------------------------------------------------------------------------- I've updated the above-named document. Go to: http://www.cse.buffalo.edu/~rapaport/563/krresources.html From - Wed Jan 22 08:51:38 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: FINAL EXAM SCHEDULE Date: Tue, 21 Jan 2003 14:37:32 -0500 (EST) Organization: Computer Science and Engineering Lines: 19 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043177852 19526 128.205.34.3 (21 Jan 2003 19:37:32 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 21 Jan 2003 19:37:32 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:12 ------------------------------------------------------------------------- Subject: FINAL EXAM SCHEDULE ------------------------------------------------------------------------- The final exam schedule has been published at: http://studentresponse.buffalo.edu/schedule/finalexamschedule.shtml (or go to MyUB and type "final exam" in the "Search MyUB" box) For CSE 463/563, our final exam is scheduled for: ========================================================================= Friday, May 2, 3:30-6:30 p.m., NSC 222 ========================================================================= I will update the syllabus to reflect this. From - Thu Jan 23 09:20:57 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: Peirce's logic Date: Wed, 22 Jan 2003 09:29:22 -0500 (EST) Organization: Computer Science and Engineering Lines: 26 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043245762 23276 128.205.34.3 (22 Jan 2003 14:29:22 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 22 Jan 2003 14:29:22 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:14 ------------------------------------------------------------------------- Subject: Peirce's logic ------------------------------------------------------------------------- CORRECTION: From Randy Dipert, concerning his lecture on Peirce's logic: Sorry: this is JANUARY 28th. The class's reading for that session consists of two articles on Peirce's logic by me, one an essay from 1995 and the other a draft from a forthcoming CAMBRIDGE (UP) COMPANION TO PEIRCE; both survey his contributions. If anyone not in the class wants copies, just ask me. --Randy Dipert rdipert@acsu.buffalo.edu > Jan 28 (Tuesday), 11-12:50 in Park 280, I'll be giving a self-contained > talk on Peirce's Logic in the context of my seminar on Peirce. Main > topics will be his modifications to Boole's logic, the theory of > relations, his co-discovery of quantifiers and especially, his > diagrammatic logic for the first-order predicate logic (the Beta > Existential Graphs) and its motivations. The Existential Graphs in > particular have attracted much attention in cognitive science (John Sowa; > Jon Barwise and students). This talk will be suitable for someone who > knows nothing about Peirce and little about logic. > From - Thu Jan 23 09:21:06 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: RECITATIONS Date: Wed, 22 Jan 2003 09:15:11 -0500 (EST) Organization: Computer Science and Engineering Lines: 19 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043244911 21981 128.205.34.3 (22 Jan 2003 14:15:11 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 22 Jan 2003 14:15:11 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:13 ------------------------------------------------------------------------- Subject: RECITATIONS ------------------------------------------------------------------------- There will be 2 recitation sections for CSE 463/563: #1 = Wednesdays, 11-11:50 a.m., Bell 242 #2 = Wednesdays, 1-1:50 p.m., Baldy 127 Please choose *one* of these to attend on a regular basis. Paul will keep a record of who attends which one. If you cannot make *either* recitation, please send email to me ASAP, and we will try to make alternative arrangements. Recitations will begin NEXT week (i.e., Jan. 29). However, Paul will try to be available TODAY (Jan 22) at those times and places for any help you might need with Project 1 (SNePS). From - Fri Jan 24 09:13:33 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SEMANTIC NETWORKS Date: Thu, 23 Jan 2003 10:39:38 -0500 (EST) Organization: Computer Science and Engineering Lines: 9 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043336378 362 128.205.34.3 (23 Jan 2003 15:39:38 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 23 Jan 2003 15:39:38 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:15 ========================================================================= Subject: SEMANTIC NETWORKS ========================================================================= I have put up a short bibliography of anthologies on semantic networks; you can access it from the Directory of Documents or directly at: http://www.cse.buffalo.edu/~rapaport/563/semnets.html From - Fri Jan 24 09:13:58 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: TA OFFICE HOURS Date: Fri, 24 Jan 2003 08:31:38 -0500 (EST) Organization: Computer Science and Engineering Lines: 18 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043415098 19960 128.205.34.3 (24 Jan 2003 13:31:38 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 24 Jan 2003 13:31:38 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:16 ------------------------------------------------------------------------- Subject: TA OFFICE HOURS ------------------------------------------------------------------------- Our TA writes as follows: > Date: Thu, 23 Jan 2003 16:04:04 -0500 (EST) > From: Paul V Gestwicki > > I'll hold office hours Wednesday 9-10 and Friday 12-1 --- this should > cover the people who can't make the recitation times as scheduled > (assuming that their schedules haven't changed since.) Paul's office is in Trailer B-11, phone 645-3772 I will update the syllabus to reflect this. From - Fri Jan 24 09:14:03 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: CSE GRAD CONFERENCE Date: Fri, 24 Jan 2003 08:41:46 -0500 (EST) Organization: Computer Science and Engineering Lines: 11 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043415706 20743 128.205.34.3 (24 Jan 2003 13:41:46 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 24 Jan 2003 13:41:46 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:17 ------------------------------------------------------------------------- Subject: CSE GRAD CONFERENCE ------------------------------------------------------------------------- The CSE Graduate Student Conference will be held all day, Monday, Feb. 3. In order to encourage your attendance at the conference, CSE 463/563 will NOT meet on Monday, Feb. 3. I will update the syllabus to reflect this. From - Mon Jan 27 09:36:56 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Re: TA OFFICE HOURS Date: Fri, 24 Jan 2003 11:17:58 -0500 Organization: The University at Buffalo Lines: 32 Sender: pvg@buffalo.edu Message-ID: References: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1043425080 4718 128.205.35.2 (24 Jan 2003 16:18:00 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 24 Jan 2003 16:18:00 +0000 (UTC) In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.563:18 Since i just set up these office hours, I happen to have a conflict for today's. I will not be in Trailer B from 12-1 today, but I will hold normal office hours and recitations starting next week. Feel free to send me an email if you have any questions. Sorry for any inconvenience -Paul On Fri, 24 Jan 2003, William J. Rapaport wrote: > ------------------------------------------------------------------------- > Subject: TA OFFICE HOURS > ------------------------------------------------------------------------- > > Our TA writes as follows: > > > Date: Thu, 23 Jan 2003 16:04:04 -0500 (EST) > > From: Paul V Gestwicki > > > > I'll hold office hours Wednesday 9-10 and Friday 12-1 --- this should > > cover the people who can't make the recitation times as scheduled > > (assuming that their schedules haven't changed since.) > > Paul's office is in Trailer B-11, phone 645-3772 > > I will update the syllabus to reflect this. > > > From - Tue Jan 28 08:51:58 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SEMANTIC NETWORKS Date: Mon, 27 Jan 2003 09:49:10 -0500 (EST) Organization: Computer Science and Engineering Lines: 12 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1043678950 7723 128.205.34.3 (27 Jan 2003 14:49:10 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 27 Jan 2003 14:49:10 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:19 ------------------------------------------------------------------------- Subject: SEMANTIC NETWORKS ------------------------------------------------------------------------- I have added some references (on SNePS, on Roger Schank's theory of conceptual dependency--which we may or may not get a chance to talk about, but which I'm likely to mention at some time or another--and on the relation of semantic networks to first-order logic) to the Semantic Networks webpage: http://www.cse.buffalo.edu/~rapaport/563/semnets.html From - Mon Feb 3 13:08:17 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: RECITATIONS Date: Mon, 3 Feb 2003 11:43:16 -0500 (EST) Organization: Computer Science and Engineering Lines: 65 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044290596 1540 128.205.34.3 (3 Feb 2003 16:43:16 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 3 Feb 2003 16:43:16 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:22 ------------------------------------------------------------------------- Subject: RECITATIONS ------------------------------------------------------------------------- The following students have told me that they can only attend the **11:00 a.m.** recitation: Adel Ahmed Claudine Barin Chengling Chan Justin Del Vecchio Michael Donato Heather Dworak Wesley Fang Phaneendra Kumar Dmitriy Lozovatskiy Priti Mendiratta Lopamudra Mukherjee Patrick Quinlan Steven Ruggieri Elina Sarkisyan Jeetal Shah Lunarso Sutanto Matthew Sweeney Shivang Vora The following students have told me that they can only attend the **1:00 p.m.** recitation: Brian Anger Albert Goldfain Zeenat Walji The following students have told me that they can attend either recitation; therefore, given the imbalance between the 2 sections, I AM HEREBY ASSIGNING THE FOLLOWING STUDENTS TO THE 1:00 P.M. SECTION: Chris Becker Erik Best Timapron Chotvinijchai Jake Farrell Carlos Lollett Patrick Lui Jeremy Merrill Vikas Singh Anantha Krishnan Ugrasenan Santha The following students have told me that they cannot attend either section; please be sure to see Paul or me on a semi-regular basis if you have questions. If there are quizzes in the recitations, Paul will contact you to set up a time to take them: Jonathan Bona Vic Moudgil The following student turned in a survey, but did not indicate either a recitation or an alternative time; please attend the 1:00 p.m. recitation if possible: Sungsoon Hwang From - Mon Feb 3 13:08:25 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW #1 Date: Fri, 31 Jan 2003 14:44:42 -0500 (EST) Organization: Computer Science and Engineering Lines: 11 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044042282 14983 128.205.34.3 (31 Jan 2003 19:44:42 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 31 Jan 2003 19:44:42 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:20 ------------------------------------------------------------------------- Subject: HW #1 ------------------------------------------------------------------------- Reminder: HW #1 is due Monday, between 10 & 10:50 a.m., at the Grad Conference in Student Union 145 A,B,E. Look for Paul or me, and give one of us your HW. On Monday, I will post HW #2 to the website (and announce it in the newsgroup). From - Mon Feb 3 13:08:31 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: REMINDER: NO CLASS TODAY, MON, FEB 3 Date: Mon, 3 Feb 2003 08:57:11 -0500 (EST) Organization: Computer Science and Engineering Lines: 12 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044280631 17454 128.205.34.3 (3 Feb 2003 13:57:11 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 3 Feb 2003 13:57:11 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:21 ------------------------------------------------------------------------- Subject: REMINDER: NO CLASS TODAY, MON, FEB 3 ------------------------------------------------------------------------- There is no class today, so that you can attend the CSE Grad Conference, in Student Union 145 A,B,E. Please hand in HW #1 between 10 & 11 am to either Paul or me at the Grad Conference. Later today, I will post HW #2, so please check this newsgroup. From - Mon Feb 3 13:08:39 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW #1 Grading Scheme Date: Mon, 3 Feb 2003 12:00:05 -0500 (EST) Organization: Computer Science and Engineering Lines: 64 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044291605 3660 128.205.34.3 (3 Feb 2003 17:00:05 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 3 Feb 2003 17:00:05 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:23 CSE 4/563, Spring 2003 Answers to HW #1 will be gone over in recitation. If you cannot attend recitation and have questions about your HW, please see Paul or me. For more information on my philosophy of grading, see: http://www.cse.Buffalo.EDU/~rapaport/grading.html HW #1 Grading Scheme ------------------------------------------------------------------------- Martins, p. 211 #5: Points: 0 = no answer 1 = bad/incorrect answer 2 = neither good nor bad ("partial" credit) 3 = good answer ------------------------------------------------------------------------- p. 211, #6: First part: Points: 0,1,2,3 Second part: Points: 0,1,2,3 Total points = 6 ------------------------------------------------------------------------- #6.1: First part: Points: 0123 Second part: Points: 0123 Total points = 6 ------------------------------------------------------------------------- Martins, p. 212 #7: Points: 0123 ------------------------------------------------------------------------- Martins, p. 212 #8: Points: 0123 ------------------------------------------------------------------------- Grand total points = 21 Letter 463 both 563 ------ --- ---- --- A 21 A- 20 B+ 19 B 17-18 B- 16 C+ 15 C 13-14 8-14 C- 10-12 D+ 8-9 D 5-7 F 0-4 From - Tue Feb 4 08:56:10 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HOMEWORK #2 Date: Mon, 3 Feb 2003 13:46:59 -0500 (EST) Organization: Computer Science and Engineering Lines: 10 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044298019 12931 128.205.34.3 (3 Feb 2003 18:46:59 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 3 Feb 2003 18:46:59 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:24 ------------------------------------------------------------------------- Subject: HOMEWORK #2 ------------------------------------------------------------------------- Homework #2 has been posted to the web at: http://www.cse.buffalo.edu/~rapaport/563/hw02.html It is due Wed, Feb 12 (since your project is due Mon, Feb 10). From - Tue Feb 4 08:56:19 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: QUERY ON HW 2 Date: Tue, 4 Feb 2003 08:51:48 -0500 (EST) Organization: Computer Science and Engineering Lines: 14 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044366708 1372 128.205.34.3 (4 Feb 2003 13:51:48 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 4 Feb 2003 13:51:48 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:25 ------------------------------------------------------------------------- Subject: QUERY ON HW 2 ------------------------------------------------------------------------- A student asks: > In homework 2, should we represent each statement with a network for > each statement, or should all statements be represented by one network ? Since the passage is a connected paragraph, you should use a single network, but you can split it up into separate parts for ease of reading if you wish. However, make sure that, if you represent some concept with a node in one part of the network, you should represent that same concept with the same node if it reappears in another part of the network (that's part of what's called the "uniqueness principle"). From - Thu Feb 6 15:17:02 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: QUESTION ABOUT HW #1, PROBLEM #5 Date: Thu, 6 Feb 2003 09:39:46 -0500 (EST) Organization: Computer Science and Engineering Lines: 38 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044542386 19186 128.205.34.3 (6 Feb 2003 14:39:46 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 6 Feb 2003 14:39:46 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:26 ------------------------------------------------------------------------- Subject: QUESTION ABOUT HW #1, PROBLEM #5 ------------------------------------------------------------------------- I have received several questions about the answer to HW #1, problem 5, viz., SNePS does not allow the following representation for the statement "Tweety is a bird": Tweety --isa--> Bird; explain the reason for this decision. It appears that the question is somewhat ambiguous. The way that I had interpreted it, it meant: Why does SNePS reject this object-oriented representation? The answer to that is: This form of representation makes it difficult, if not impossible, to represent the negation of that proposition (i.e., Tweety is not a bird) or to represent that someone believes that proposition (e.g., Mary believes that Tweety is a bird). (This was the topic of a long presentation in lecture.) However, several of you interpreted the question to mean: Why is it impossible to create that network in SNePS? The answer to *this* question is that the only way to create a SNePS network is to use "build", "assert", "add", or "deduce", none of which will (find or) build a network dominated by an "atomic constant node" (such as the node "Tweety" presumably is in the "bad" object-oriented representation); "build", "assert", etc., will only (find or) build networks dominated by nodes whose identifiers are generated by SNePS and that begin with "M". The problem with this as an answer to the question is that it prompts the former question: OK, *granted* that it is impossible to create that object-oriented network in SNePS, *why* is it impossible? But that is the first interpretation of the question, to which we can give the first answer above. Given this ambiguity, which I had not noticed before, I suppose it's reasonable to give partial credit for the second answer. Accordingly, if you think that you gave a version of the second answer, only got 1 point, and would like us to regrade your HW, please bring it to lecture on Friday (Feb. 7), and I will look it over. From - Mon Feb 10 09:49:11 2003 Path: acsu.buffalo.edu!vsingh From: Vikas Singh Newsgroups: sunyab.cse.563 Subject: AND-OR Connective Date: Fri, 7 Feb 2003 22:42:56 -0500 Organization: The University at Buffalo Lines: 10 Sender: Ncs@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1044675779 21032 128.205.35.2 (8 Feb 2003 03:42:59 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Sat, 8 Feb 2003 03:42:59 +0000 (UTC) Originator: vsingh@pollux.cse.buffalo.edu Xref: acsu.buffalo.edu sunyab.cse.563:27 Dr.Rapaport: It will be very useful if you could point out how to represent the And-Or connective in Latex. Putting a AND in the superscript and a OR in the subscript does not give satisfactory results. Sincerely, Vikas. From - Mon Feb 10 09:49:18 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: UPDATED SYLLABUS Date: Mon, 10 Feb 2003 09:47:41 -0500 (EST) Organization: Computer Science and Engineering Lines: 10 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044888461 282 128.205.34.3 (10 Feb 2003 14:47:41 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 10 Feb 2003 14:47:41 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:28 ------------------------------------------------------------------------- Subject: UPDATED SYLLABUS ------------------------------------------------------------------------- I have updated the syllabus to reflect some minor schedule changes. Go to: http://www.cse.buffalo.edu/~rapaport/563/syl.html From - Wed Feb 12 14:15:56 2003 Path: acsu.buffalo.edu!not-for-mail From: "William J. Rapaport" Newsgroups: sunyab.cse.563 Subject: Re: AND-OR Connective Date: Mon, 10 Feb 2003 09:51:54 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 45 Sender: rapaport@buffalo.edu Message-ID: <3E47BC8A.A545C709@cse.buffalo.edu> References: NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Trace: prometheus.acsu.buffalo.edu 1044888714 417 128.205.34.3 (10 Feb 2003 14:51:54 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 10 Feb 2003 14:51:54 +0000 (UTC) X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.563:29 Vikas Singh wrote: > > Dr.Rapaport: > > It will be very useful if you could point out how to represent the And-Or > connective in Latex. Putting a AND in the superscript and a OR in the > subscript does not give satisfactory results. > > Sincerely, > > Vikas. Good question! I've never tried it, but this might work: $\bigvee\!\bigwedge$ You'll have to experiment to see how much "negative space", provided by the "\!" to use; e.g., $\bigvee\!\!\bigwedge$ might work better. Let us know what works, please! -Bill -- ------------------------------------------------------------------------- William J. Rapaport Associate Professor of Computer Science & Adjunct Professor of Philosophy Member, Center for Cognitive Science Associate Director, SNePS Research Group (SNeRG) 201 Bell Hall (office: 214 Bell) | 716-645-3180 x 112 Dept. of Computer Science & Engineering | fax: 716-645-3464 University at Buffalo (SUNY) | rapaport@cse.buffalo.edu Buffalo, NY 14260-2000 | ------------------------------------------------------------------------- CSE: www.cse.buffalo.edu/ homepage: www.cse.buffalo.edu/~rapaport/ SNeRG: www.cse.buffalo.edu/sneps/ Buffalo Restaurant Guide: www.cse.buffalo.edu/restaurant.guide/ Cognitive Science: wings.buffalo.edu/cogsci/ From - Wed Feb 12 14:16:17 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: QUERY ABOUT "FOR ALL" QUERIES Date: Mon, 10 Feb 2003 11:38:07 -0500 (EST) Organization: Computer Science and Engineering Lines: 105 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044895087 9618 128.205.34.3 (10 Feb 2003 16:38:07 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 10 Feb 2003 16:38:07 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:30 ------------------------------------------------------------------------- Subject: QUERY ABOUT "FOR ALL" QUERIES ------------------------------------------------------------------------- A student writes: > I was wondering if you could help me with the following > question: > > I want to represent the following statements in sneps: > - joe is a dog > - dogs have legs > > so I type the following: > > (assert member joe class dog) > (assert forall $x > ant (build member *x class dog) > cq (build object *x has leg)) > > > Now, when I ask the system if joe has a leg, it returns yes; but when I > ask it if dog has a leg, it says "don't know" since we are only defining > the rule for members of the class but not for the class itself. > > If I want to include the class itself, is it okay to follow > every 'forall" with an assert statement for the class as shown below: > > (assert member joe class dog) > (assert forall $x > ant (build member *x class dog) > cq (build object *x has leg)) <-- for members of the class > > (assert object dog has leg) <- for the class itself. > > -- > If that's not correct, how about the following statements in which > I use path-based inference instead. > > > (assert member joe class dog) > (assert object dog has leg) <-- dogs have legs > > (define-path object (compose object (kstar (compose class- member)))) This is a very good question; in fact, it is one of the underlying motivations for an "upgrade" to SNePS from SNePS 2.6 (which you are learning) and SNePS 3 (which is currently under development). The issue is this: If both of the following are in the KB: 1) Joe is a dog 2) All dogs have legs and we want to know who has legs, which of the following is a "better" answer: a) Joe b) all dogs c) Joe and all (other) dogs. The issue can become sharper if the KB only has (2) in it, for then, clearly, we would like (b) to be the answer. SNePS 2.6, however, will reply only with (a) if the KB contains both (1) and (2), and will reply with "I don't know" (or silence) if the KB contains only (2). The reason for this has to do with the fact that SNIP will only look for asserted propositions that match the consequent of a rule, and an entire rule itself doesn't match its own consequent. To overcome this, one of our PhD alumni, Syed Ali (http://tigger.cs.uwm.edu/~syali/), suggested (in his dissertation) a new notation, which he called "ANALOG" (for: A Natural Logic). In ANALOG, (2) would be represented, not as if it were a universally quantified sentence (as in FOL), i.e., of the form: forall x, if x is a dog, then x has legs but as it is in English, namely, as a subject-predicate sentence of the form: (all dogs) (have legs) Now it has the same structure as "Joe has legs". Ali then wrote a new inference package that could deal with this. A revised version of this notation is the basis of Snepd 3. For more information on ANALOG, see: Syed S. Ali and Stuart C. Shapiro. Natural language processing using a propositional semantic network with structured variables. Minds and Machines, 3(4):421-451, November 1993. http://www.cse.buffalo.edu/tech-reports/93-16.ps For more information on SNePS 3, see: Stuart C. Shapiro, An Introduction to SNePS 3. In Bernhard Ganter & Guy W. Mineau, Eds. Conceptual Structures: Logical, Linguistic, and Computational Issues. Lecture Notes in Artificial Intelligence 1867. Springer-Verlag, Berlin, 2000, 510--524. http://www.cse.buffalo.edu/~shapiro/Papers/sneps3intro.ps From - Wed Feb 12 14:19:48 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: ON THE REPRESENTATION OF "I WENT TO THE STORE YESTERDAY" Date: Mon, 10 Feb 2003 11:52:47 -0500 (EST) Organization: Computer Science and Engineering Lines: 49 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044895967 10989 128.205.34.3 (10 Feb 2003 16:52:47 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 10 Feb 2003 16:52:47 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:31 ------------------------------------------------------------------------- Subject: ON THE REPRESENTATION OF "I WENT TO THE STORE YESTERDAY" ------------------------------------------------------------------------- Here are some of the references I promised you about the issue of representing time and tense, and on representing indexicals such as "I", "here", and "now". On representing time and tense: ------------------------------------------------------------------------- James Allens' theory: (the first of these is probably the most accessible since it was intended for a general CS audience) Allen, J.F. ``Maintaining Knowledge about Temporal Intervals.'' Communications of the ACM 26, 11, 832-843, November 1983. http://delivery.acm.org/10.1145/360000/358434/p832-allen.pdf?key1=358434&key2=9705984401&coll=portal&dl=ACM&CFID=7648761&CFTOKEN=35097115 Allen, J.F. ``A General Model of Action and Time.'' Artificial Intelligence 23, 2, July 1984. Allen, J.F. and P.J. Hayes. ``Moments and Points in an Interval-Based Temporal Logic.'' Computational Intelligence, January 1990. Allen, J.F. "Time and time again: The many ways to represent time," Int'l. Jr. of Intelligent Systems 6, 4, 341-356, July 1991. ftp://ftp.cs.rochester.edu/pub/u/james/allen-time-again-91.ps.gz Allen, J.F. and Ferguson, G. Actions and Events in Interval Temporal Logic, J. Logic and Computation 4, 5, 1994. ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr521.Actions_and_events_in_interval_temporal_logic.ps.Z Michael Almeida's SNePS theory: ------------------------------------------------------------------------- Michael J. Almeida. Time in narratives. In Judith F. Duchan, Gail A. Bruder, and Lynne E. Hewitt, editors, Deixis in Narrative: A Cognitive Science Perspective, pages 159-189. Lawrence Erlbaum Associates, Inc., Hillsdale, NJ, 1995. http://www.cse.buffalo.edu/~rapaport/676/F01/almeida95.pdf The UB approach to indexicals and deixis: ------------------------------------------------------------------------- Duchan, Judith Felson; Bruder, Gail A.; & Hewitt, Lynne E. (eds.) (1995), Deixis in Narrative: A Cognitive Science Perspective (Hillsdale, NJ: Lawrence Erlbaum Associates). http://www.cse.buffalo.edu/~rapaport/dc.html From - Wed Feb 12 14:20:04 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: WRITING Date: Mon, 10 Feb 2003 12:44:47 -0500 (EST) Organization: Computer Science and Engineering Lines: 22 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044899087 15036 128.205.34.3 (10 Feb 2003 17:44:47 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 10 Feb 2003 17:44:47 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:32 ------------------------------------------------------------------------- Subject: WRITING ------------------------------------------------------------------------- Part of your undergraduate and/or graduate education ought to be learning how to write well, and practicing it. This is one of the reasons I require written project reports, and not just code. No matter what you do after you graduate, you will almost certainly have to do some writing, and you will be expected to do it well. Those of you who have trouble with writing should certainly take a look at parts of my "How to Write" webpage that deal with those issues. http://www.cse.buffalo.edu/~rapaport/howtowrite.html Or you might consider taking a writing course. SEAS offers undergrad and grad (I think) courses in technical writing. If English is not your native language, you have a bit of an excuse, but you should still try to improve or perfect your English writing ability. In addition to SEAS or Dept. of ENG writing courses, perhaps the folks who offer the intensive English courses can help. From - Wed Feb 12 14:20:13 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HOW TO REPRESENT ADVERBS (AND VAGUE ONES AT THAT) Date: Tue, 11 Feb 2003 15:07:14 -0500 (EST) Organization: Computer Science and Engineering Lines: 73 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1044994034 3039 128.205.34.3 (11 Feb 2003 20:07:14 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 11 Feb 2003 20:07:14 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:33 ------------------------------------------------------------------------- Subject: HOW TO REPRESENT ADVERBS (AND VAGUE ONES AT THAT) ------------------------------------------------------------------------- A student writes: > If I wanted to represent the proposition: "The rain in Spain falls > mainly on the plain" how might I represent the concept "mainly"? (By the > way...this is the statement that came to mind just miliseconds after pat > suggested "I went to the store yesterday"). My initial thought was > that you need some way to link mainly to "the majority of the time on the > plain, but perhaps sometimes in other areas". I suspect that SNePS will > do a very good job at modelling first order logic... > but how does it handle concepts with fuzzy boundaries such as "mainly"? There are two issues here: 1. How to represent adverbs ("mainly") 2. How to represent vague information (what does "mainly" mean?) 1. How to represent adverbs ("mainly") One option: Adverbs like "mainly" modify verbs. So it is the falling of the rain that happens "mainly". So, use an object-property case frame with the object pointing to the action of falling. A better option: It is really the phrase "mainly on the plain" that modifies falling; it specifies where the rain falls. So, use some sort of "location" arc that points to a structured individual node that, in turn, represents "mainly on the plain", perhaps along these lines: (assert agent rain act (build action fall location "mainly on the plain")) where you'll have to fill in the details of building "mainly on the plain". A still better option: Do some reading (also known as "research") about the representation of adverbial modifiers in the linguistics and the philosophy literature. The most widely cited article, by both linguists and philosophers is: Davidson, Donald (1967), "The Logical Form of Action Sentences", in Nicholas Rescher (ed.), _The Logic of Decision and Action_ (Pittsburgh: University of Pittsburgh Press). Reprinted in in D. Davidson, _Essays on Actions and Events_ (Oxford: Clarendon Press). There are also a couple of SNePS papers on aspects of this problem: R. Wyatt. Kinds of opacity and their representations. In D. Kumar, editor, Current Trends in SNePS-Semantic Network Processing System: Proceedings of the First Annual SNePS Workshop, pages 123-144, Buffalo, NY, 1990. Springer-Verlag. Wyatt, Richard (1993), ``Reference and Intensions,'' {\it Journal of Experimental and Theoretical Artificial Intelligence\/} 5:~263--271. 2. How to represent vague information (what does "mainly" mean?) This problem concerns, not the representation of "mainly", but of its meaning. What inferences can be drawn when you believe that the rain falls mainly on the plain? (I.e., what things follow from that, what are its necessary conditions?) And what things would, if true, imply that the rain falls "mainly" on the plain? (I.e., what are its sufficient conditions? In general, what sort of SNePS rule nodes should you add to your KB that would enable it to reason about "mainly"? I have no good answer to this one, except to say that there has been a lot written on the topic of vagueness, in linguistics, philosophy, and AI. From - Wed Feb 12 14:20:23 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Prepositions and Propositions Date: Wed, 12 Feb 2003 12:34:38 -0500 Organization: The University at Buffalo Lines: 20 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1045071280 22469 128.205.35.2 (12 Feb 2003 17:34:40 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 12 Feb 2003 17:34:40 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:34 In project 1, many students seem to be confused between a "preposition" and a "proposition". SNePS is a propositional network, since it represents propositions. An example of a proposition is: "MSN.com intentionally sabotaged Opera 7 by supplying faulty style-sheets." (Whether or not this should be asserted is open to debate; see http://my.opera.com/dev/discussion/openweb/20030206/ for details). I'm not sure if there is such a thing as a prepositional network, but it would certainly involve prepositions such as "from", "to", "above", and "with". The portion of the sentence "by supplying faulty style-sheets" is a prepositional phrase. When I was working on my own contextual vocabulary acquisition project in SNePS, I remember having some difficulty finding the most effective way to represent prepositional phrases in a propositional network, but that's another story. -Paul From - Thu Feb 13 12:42:11 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: THE "ANDOR" CONNECTIVE IN SNePS Date: Wed, 12 Feb 2003 15:19:27 -0500 (EST) Organization: Computer Science and Engineering Lines: 28 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045081167 9555 128.205.34.3 (12 Feb 2003 20:19:27 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 12 Feb 2003 20:19:27 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:35 sunyab.cse.740:21 ------------------------------------------------------------------------- Subject: THE "ANDOR" CONNECTIVE IN SNePS ------------------------------------------------------------------------- I have put several articles on reserve that discuss SNePS's non-standard "andor" connective. To access them, go to the UB Libraries Catalog (Bison), choose "Course Reserve" on the bottom left, enter as the course number "CSE563" (cap "CSE", no space before numerals), then choose "Start Search" on the bottom, then find the article you want; they're all in PDF (Acrobat) format. R. Bechtel and S. C. Shapiro. A logic for semantic networks. Technical Report 47, Computer Science Department, Indiana University, Bloomington, IN, 1976. S. C. Shapiro. Using non-standard connectives and quantifiers for representing deduction rules in a semantic network, 1979. Invited paper presented at Current Aspects of AI Research, a seminar held at the Electrotechnical Laboratory, Tokyo. J. P. Martins and S. C. Shapiro. A model for belief revision. Artificial Intelligence, 35(1):25-79, 1988. From - Thu Feb 13 12:43:19 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: GRADES Date: Wed, 12 Feb 2003 15:48:10 -0500 (EST) Organization: Computer Science and Engineering Lines: 34 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045082890 12171 128.205.34.3 (12 Feb 2003 20:48:10 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 12 Feb 2003 20:48:10 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:36 ------------------------------------------------------------------------- Subject: GRADES ------------------------------------------------------------------------- Paul Gestwicki wrote to me: | One student did ask about the grading schemes and if the grad | students would have a different curve than undergrad students, and I told | her that I'd forward the question to you. I don't grade on a curve. I use "relatively absolute" grading; i.e., each gradable item is given (a multiple of) either 0, 1, 2, or 3 points, usually interpretable as follows: 0 = not done 1 = badly done; shows no understanding 2 = partial credit; not clearly worth either 1 or 3 points 3 = well done; shows understanding I then map these to letter grades using roughly the following scheme: A = 3 points C = 2 points (C is, by definition, "average") D = 1 point F = 0 points Grades of B appear when things get averaged. As you may know, undergrads and grads have different letter-grade schemes, and I use those differences to differentiate grades for grads and undergrads. For the full details, see my webpage, "GRADING PRINCIPLES", at: http://www.cse.buffalo.edu/~rapaport/grading.html From - Thu Feb 13 12:43:39 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW #2 Grading Scheme Date: Thu, 13 Feb 2003 09:45:00 -0500 (EST) Organization: Computer Science and Engineering Lines: 86 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045147500 20086 128.205.34.3 (13 Feb 2003 14:45:00 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 13 Feb 2003 14:45:00 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:37 ------------------------------------------------------------------------- Subject: HW #2 Grading Scheme ------------------------------------------------------------------------- CSE 4/563, Spring 2003 HW #2 Grading Scheme ------------------------------------------------------------------------- Answers will vary. A hard copy of my solution was handed out in recitation on 12 February, but it is only one of many possible ones. For the syntax/semantics: 3 points for a decent answer that is legal SNePS, even if it is not the best possible representation. 1 point for a representation that is arguably incorrect in some way or that violates SNePS syntax. 2 points if it's neither 1 nor 3. For the representation: 3 points if it is plausible and consistent with the syntax/semantics, even it is not the best possible representation. 2 points if it is plausible but inconsistent with the syntax/semantics (or, by default, if it's neither 3 points nor 1 point). 1 point if it is implausible. Note that the syntax/semantics for each sentence may involve several case frames. Paul might grade each on a 0123 scale, and then average them. Or he might total them, but then grade each representation out of the same number of points. (E.g., if someone gives syntax/semantics for, say, 8 case frames for sentence 1 (as my answer does), then the representation of sentence 1 might be graded on a 0,2,5,8 scale.) 1. Anna knows that John bought a dog. syntax/semantics 0123 representation 0123 2. The dog is a German shepherd. syntax/semantics 0123 representation 0123 3. John paid $300 for the dog. syntax/semantics 0123 representation 0123 4. Anna also knows that Stu sold his dog. syntax/semantics 0123 representation 0123 5. Anna believes that John bought Stu's dog. syntax/semantics 0123 representation 0123 ------------------------------------------------------------------------- Grand total points = 30 (or some multiple thereof) Letter 463 both 563 ------ --- ---- --- A 29-30 A- 28 B+ 26-27 B 24-25 B- 23 C+ 21-22 C 18-20 11-20 C- 13-17 D+ 11-13 D 6-10 F 0-5 From - Fri Feb 14 09:01:54 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: Prepositions and Propositions Date: Thu, 13 Feb 2003 16:05:20 -0500 (EST) Organization: Computer Science and Engineering Lines: 12 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045170320 23754 128.205.34.3 (13 Feb 2003 21:05:20 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 13 Feb 2003 21:05:20 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:39 ------------------------------------------------------------------------- Subject: Prepositions and Propositions ------------------------------------------------------------------------- As a follow-up to Paul's posting about this confusion, I've prepared a couple of webpages that you might find amusing or useful, or both :-) Propositions http://www.cse.buffalo.edu/~rapaport/propositions.html Prepositions http://www.cse.buffalo.edu/~rapaport/prepositions.html From - Fri Feb 14 09:02:13 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: NEW WEBPAGE ON SYNTAX VS. SEMANTICS Date: Thu, 13 Feb 2003 14:38:02 -0500 (EST) Organization: Computer Science and Engineering Lines: 8 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045165082 16316 128.205.34.3 (13 Feb 2003 19:38:02 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 13 Feb 2003 19:38:02 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:38 ------------------------------------------------------------------------- Subject: NEW WEBPAGE ON SYNTAX VS. SEMANTICS ------------------------------------------------------------------------- I've added a webpage on syntax vs. semantics; go to: http://www.cse.buffalo.edu/~rapaport/563/fol.html From - Mon Feb 17 09:04:49 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: MORE ON SYNTAX VS. SEMANTICS Date: Fri, 14 Feb 2003 09:40:42 -0500 (EST) Organization: Computer Science and Engineering Lines: 14 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045233642 25541 128.205.34.3 (14 Feb 2003 14:40:42 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 14 Feb 2003 14:40:42 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:40 sunyab.cse.740:23 ------------------------------------------------------------------------- Subject: MORE ON SYNTAX VS. SEMANTICS ------------------------------------------------------------------------- Failing to provide a semantics for your syntax is an error that I frequently find in student (and professional!) papers, reports, and articles. I have updated my "How to Write" webpage to discuss this. Go to: http://www.cse.Buffalo.EDU/~rapaport/howtowrite.html#boxandarrow From - Mon Feb 17 09:05:30 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW #2 Grading Scheme Date: Thu, 13 Feb 2003 09:45:00 -0500 (EST) Organization: Computer Science and Engineering Lines: 86 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045147500 20086 128.205.34.3 (13 Feb 2003 14:45:00 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 13 Feb 2003 14:45:00 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:37 ------------------------------------------------------------------------- Subject: HW #2 Grading Scheme ------------------------------------------------------------------------- CSE 4/563, Spring 2003 HW #2 Grading Scheme ------------------------------------------------------------------------- Answers will vary. A hard copy of my solution was handed out in recitation on 12 February, but it is only one of many possible ones. For the syntax/semantics: 3 points for a decent answer that is legal SNePS, even if it is not the best possible representation. 1 point for a representation that is arguably incorrect in some way or that violates SNePS syntax. 2 points if it's neither 1 nor 3. For the representation: 3 points if it is plausible and consistent with the syntax/semantics, even it is not the best possible representation. 2 points if it is plausible but inconsistent with the syntax/semantics (or, by default, if it's neither 3 points nor 1 point). 1 point if it is implausible. Note that the syntax/semantics for each sentence may involve several case frames. Paul might grade each on a 0123 scale, and then average them. Or he might total them, but then grade each representation out of the same number of points. (E.g., if someone gives syntax/semantics for, say, 8 case frames for sentence 1 (as my answer does), then the representation of sentence 1 might be graded on a 0,2,5,8 scale.) 1. Anna knows that John bought a dog. syntax/semantics 0123 representation 0123 2. The dog is a German shepherd. syntax/semantics 0123 representation 0123 3. John paid $300 for the dog. syntax/semantics 0123 representation 0123 4. Anna also knows that Stu sold his dog. syntax/semantics 0123 representation 0123 5. Anna believes that John bought Stu's dog. syntax/semantics 0123 representation 0123 ------------------------------------------------------------------------- Grand total points = 30 (or some multiple thereof) Letter 463 both 563 ------ --- ---- --- A 29-30 A- 28 B+ 26-27 B 24-25 B- 23 C+ 21-22 C 18-20 11-20 C- 13-17 D+ 11-13 D 6-10 F 0-5 From - Tue Feb 18 09:03:13 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: CORRECTIONS AND COMMENTS FOR HW #3 Date: Mon, 17 Feb 2003 11:29:04 -0500 (EST) Organization: Computer Science and Engineering Lines: 66 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045499344 8015 128.205.34.3 (17 Feb 2003 16:29:04 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 17 Feb 2003 16:29:04 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:41 ------------------------------------------------------------------------- Subject: CORRECTIONS AND COMMENTS FOR HW #3 ------------------------------------------------------------------------- Several of you had questions after class today about HW #3. 1. Some of you may be using an earlier, incomplete version of the HW!!! This would have happened had you printed it out before I announced it in lecture. (I was modifying it as recently as 10 minutes before class began!) So: Be sure to check the HW website: http://www.cse.buffalo.edu/~rapaport/563/hw03.html to make sure you have the correct version!!!! 2. There is a (small) error in HW #3. I forgot to specify in the syntax and semantics of the small language for fire, smoke, etc., that HEAT is an atomic wff whose English semantics can be given as: [[HEAT]] = there is heat. I will update the HW webpage to indicate this. 3. When you have to translate from this propositional language to English, you can do it using the following (which can be considered as the English semantics for molecular formulas): Let P, Q be wffs. Then [[~P]] = it is not the case that [[P]] [[P ^ Q]] = [[P]] and [[Q]] [[P v Q]] = [[P]] or [[Q]] [[P -> Q]] = if [[P]] then [[Q]] So, e.g., suppose we add the atomic wff UNICORN to our language, where [[UNICORN]] = there are unicorns. Then [[~(FIRE ^ UNICORN)]] = it is not the case that [[(FIRE ^ UNICORN)]] = it is not the case that [[FIRE]] and [[UNICORN]] = it is not the case that there is fire and there are unicorns If you want to use more idiomatic (i.e., less "stilted") English than this translation scheme permits, you could say things like this: [[P -> Q]] = [[P]] implies [[Q]] but if so, then give the semantics! From - Tue Feb 18 09:03:36 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROPOSITIONAL LOGIC Date: Mon, 17 Feb 2003 11:34:17 -0500 (EST) Organization: Computer Science and Engineering Lines: 24 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045499657 8508 128.205.34.3 (17 Feb 2003 16:34:17 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 17 Feb 2003 16:34:17 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:42 ------------------------------------------------------------------------- Subject: PROPOSITIONAL LOGIC ------------------------------------------------------------------------- Since B&L don't say very much about propositional logic, you might want to read my article about it in the Encyclopedia of AI, which also presents the rules of inference that I talked about today. It's on the web; link to the page on "Language of First-Order Logic (and other things, like Syntax vs. Semantics)" from the Directory of Documents: http://www.cse.buffalo.edu/~rapaport/563/fol.html or go directly to: Rapaport, William J. (1992), "Logic, Propositional", in Stuart C. Shapiro (ed.), Encyclopedia of Artificial Intelligence, 2nd edition (New York: John Wiley): 891-897. http://www.cse.buffalo.edu/~rapaport/Papers/logic,propositional.pdf From - Tue Feb 18 09:04:01 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: TRANSLATING BETWEEN LOGIC AND ENGLISH Date: Mon, 17 Feb 2003 11:51:08 -0500 (EST) Organization: Computer Science and Engineering Lines: 18 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045500668 9720 128.205.34.3 (17 Feb 2003 16:51:08 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 17 Feb 2003 16:51:08 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:43 ------------------------------------------------------------------------- Subject: TRANSLATING BETWEEN LOGIC AND ENGLISH ------------------------------------------------------------------------- In HW #3, I ask you to represent (i.e., translate) some English sentences into our language for propositional logic, and to translate some wffs of that language into English. It is much easier to do the latter than the former, since you can easily use the semantics I gave in an earlier newsgroup posting. It is non-trivial to do the former (and some English sentences canNOT be translated into even FOL). For more information on this problem of translation from English to logic, see the references given on the webpage "Some references on translating from English to logic" at: http://www.cse.buffalo.edu/~rapaport/572/S02/eng.to.logic.html From - Tue Feb 18 09:04:37 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Material Conditional and Non-Material Conditional Date: Mon, 17 Feb 2003 13:13:36 -0500 Organization: The University at Buffalo Lines: 18 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1045505617 17192 128.205.35.2 (17 Feb 2003 18:13:37 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 17 Feb 2003 18:13:37 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:44 I found myself intrigued by the name "material conditional", since I was not sure what the "material" adjective entailed. I talked to the professor and found a few online resources on the material conditional and on the non-material conditional. For any of you who are also curious about the difference between these, here are two brief articles: Material Conditional: http://www.bcc.ctc.edu/ArtsHum/materials/phil/Payne/115Material_Conditionals.htm Non-Material Conditional: http://www.bcc.ctc.edu/ArtsHum/materials/phil/Payne/115Non-material_Conditionals.htm On an unrelated note, you should receive your graded projects and homework #2 submissions in Wednesday's recitation. For the three students who are not enrolled in a recitation, I will bring your papers to lecture on Wednesday. From - Tue Feb 18 13:41:04 2003 Path: acsu.buffalo.edu!zawalji From: Zeenat A Walji Newsgroups: sunyab.cse.563 Subject: Re: CORRECTIONS AND COMMENTS FOR HW #3 Date: Tue, 18 Feb 2003 13:24:24 -0500 Organization: The University at Buffalo Lines: 81 Sender: Ncs@buffalo.edu Message-ID: References: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1045592665 20859 128.205.35.2 (18 Feb 2003 18:24:25 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Feb 2003 18:24:25 +0000 (UTC) To: "William J. Rapaport" In-Reply-To: Originator: zawalji@pollux.cse.buffalo.edu Xref: acsu.buffalo.edu sunyab.cse.563:46 Hello, You talk about [[P -> Q]] meaning if P then Q below, how about [[P <-> Q ]]? Thanks, Zeenat On Mon, 17 Feb 2003, William J. Rapaport wrote: > ------------------------------------------------------------------------- > Subject: CORRECTIONS AND COMMENTS FOR HW #3 > ------------------------------------------------------------------------- > > Several of you had questions after class today about HW #3. > > > 1. > Some of you may be using an earlier, incomplete version of the HW!!! > This would have happened had you printed it out before I announced it in > lecture. (I was modifying it as recently as 10 minutes before class > began!) > > So: Be sure to check the HW website: > > http://www.cse.buffalo.edu/~rapaport/563/hw03.html > > to make sure you have the correct version!!!! > > > > 2. > There is a (small) error in HW #3. I forgot to specify in the syntax > and semantics of the small language for fire, smoke, etc., that > > HEAT is an atomic wff > > whose English semantics can be given as: > > [[HEAT]] = there is heat. > > I will update the HW webpage to indicate this. > > > 3. > When you have to translate from this propositional language to English, > you can do it using the following (which can be considered as the > English semantics for molecular formulas): > > Let P, Q be wffs. Then > > [[~P]] = it is not the case that [[P]] > [[P ^ Q]] = [[P]] and [[Q]] > [[P v Q]] = [[P]] or [[Q]] > [[P -> Q]] = if [[P]] then [[Q]] > > So, e.g., suppose we add the atomic wff UNICORN to our language, where > [[UNICORN]] = there are unicorns. > > Then [[~(FIRE ^ UNICORN)]] > > = it is not the case that [[(FIRE ^ UNICORN)]] > > = it is not the case that [[FIRE]] and [[UNICORN]] > > = it is not the case that there is fire and there are unicorns > > If you want to use more idiomatic (i.e., less "stilted") English than > this translation scheme permits, you could say things like this: > > [[P -> Q]] = [[P]] implies [[Q]] > > but if so, then give the semantics! > > > > Zeenat Abbas Walji From - Tue Feb 18 14:06:35 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MORE ON THE MATERIAL CONDITIONAL Date: Tue, 18 Feb 2003 11:08:13 -0500 (EST) Organization: Computer Science and Engineering Lines: 21 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045584493 8698 128.205.34.3 (18 Feb 2003 16:08:13 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Feb 2003 16:08:13 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:45 Another reason that horseshoe (or ->) is called the "material" conditional is to contrast it with: subjunctive conditional: if I were to sing, then you would be unhappy counterfactual conditional: if I had sung, then you would have been unhappy You can find a lot more info about the material conditional by doing a Google search on "material conditional" http://www.google.com/search?hl=en&ie=UTF-8&oe=UTF-8&q=material+conditional Two useful items I found by doing that are: O'Rourke, Michael (2000), "The Meaning of the Material Conditional" http://www.class.uidaho.edu/morourke/211-philosophy/00%20Spring/Handouts/Philosophical/Chapter%204/Material-Conditional.htm Smith, Peter (2002), Ch. 16: "The Material Conditional" http://www.philosophy.cam.ac.uk/Smith/1Alogic/references/Chap16.pdf From - Wed Feb 19 08:54:24 2003 Path: acsu.buffalo.edu!not-for-mail From: "William J. Rapaport" Newsgroups: sunyab.cse.563 Subject: Re: CORRECTIONS AND COMMENTS FOR HW #3 Date: Tue, 18 Feb 2003 14:05:45 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 85 Sender: rapaport@buffalo.edu Message-ID: <3E528409.44228071@cse.buffalo.edu> References: NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Trace: prometheus.acsu.buffalo.edu 1045595159 24290 128.205.34.3 (18 Feb 2003 19:05:59 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Feb 2003 19:05:59 +0000 (UTC) X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.563:47 Zeenat A Walji wrote: > > You talk about [[P -> Q]] meaning if P then Q ..., how about [[P <-> Q]]? Oops; sorry I forgot this one! I'll explain it below, along with several other comments. This is a long message, so read on.... 1. [[P <-> Q]] = [[P]] iff [[Q]], or, if you prefer: [[P]] if and only if [[Q]]. Note that "X iff Y" means "X if and only if Y", which means "X if Y and X only if Y". But it also means "X if Y and Y if X", so "X only if Y" must mean the same as "Y if X". 2. I've also had some questions about how to translate complicated molecular wffs into English. It's actually quite straightforward, even though the results might not sound very idiomatic. (But, after all, very few people except logicians and lawyers talk this way!) Here's an example: Let [[snow]] = it's snowing and [[sunny]] = it's sunny and [[buffalo]] = we're in Buffalo Then: [[ (snow -> buffalo) -> ((sunny -> buffalo) -> buffalo)) ]] = if [[ (snow -> buffalo) ]] then [[((sunny -> buffalo) -> buffalo)]] = if, if [[snow]] then [[buffalo]], then, if [[(sunny -> buffalo)]] then [[buffalo]] = if, if it's snowing, then we're in Buffalo, then, if, if [[sunny]] then [[buffalo]], then we're in Buffalo = if, if it's snowing, then we're in Buffalo, then, if, if it's sunny, then we're in Buffalo, then we're in Buffalo And that, believe it or not, is grammatically correct English. (Well, it's grammatically correct "mathematical" English, to be more precise.) (As an aside, I'll certainly agree that it's not "acceptable" English. It would be very difficult to understand a sentence like this without pencil and paper to help analyze it. I'll give you another example of a grammatically correct, but hard to understand, sentence of English at the end of this posting.) 3. Contrary to what you might think, the phrase "either P or Q" does NOT mean exclusive disjunction (i.e., P or Q, but not both). It is, in fact, ambiguous between the inclusive and exclusive readings. So, when trying to decide how to represent an "either/or" statement in logic, you could use your understanding of the subject matter to decide, but if that doesn't help, you should always err on the side of caution and interpret it *inclusively*. 4. This is not directly related to any of the above, but here are two examples of grammatically correct, but hard-to-understand, sentences of English. Can you figure out what they mean? Dogs dogs dog dog dogs. and Buffalo buffalo buffalo buffalo buffalo. From - Thu Feb 20 08:56:39 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: "SEND" AND "RETURN" Date: Wed, 19 Feb 2003 16:12:12 -0500 (EST) Organization: Computer Science and Engineering Lines: 9 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045689132 11900 128.205.34.3 (19 Feb 2003 21:12:12 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 19 Feb 2003 21:12:12 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:48 ------------------------------------------------------------------------- Subject: "SEND" AND "RETURN" ------------------------------------------------------------------------- The details of how and when to use SEND and RETURN are now available on the web at: http://www.cse.buffalo.edu/~rapaport/563/sendreturn.html From - Fri Feb 21 08:46:41 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: "SEND" AND "RETURN" Date: Thu, 20 Feb 2003 09:04:25 -0500 (EST) Organization: Computer Science and Engineering Lines: 9 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045749865 791 128.205.34.3 (20 Feb 2003 14:04:25 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 20 Feb 2003 14:04:25 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:49 ------------------------------------------------------------------------- Subject: "SEND" AND "RETURN" ------------------------------------------------------------------------- I have very slightly modified the Web page on SEND and RETURN to make it clearer when SEND can be applied. http://www.cse.buffalo.edu/~rapaport/563/sendreturn.html From - Fri Feb 21 08:47:36 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: BOB CAN'T BE BOTH UP AND DOWN Date: Thu, 20 Feb 2003 09:21:18 -0500 (EST) Organization: Computer Science and Engineering Lines: 72 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045750878 2745 128.205.34.3 (20 Feb 2003 14:21:18 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 20 Feb 2003 14:21:18 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:50 ------------------------------------------------------------------------- Subject: BOB CAN'T BE BOTH UP AND DOWN ------------------------------------------------------------------------- Several of you were unhappy with how I chose to represent the English sentence Bob can't be both up and down. in propositional logic, and suggested using exclusive-or instead. It turns out that it doesn't matter which you use, at least for my ultimate purpose, which was to motivate the rule of ~INTRO (or "reductio ad absurdum"). I interpreted the sentence as follows: Bob can't be both up and down. i.e.: It can't be the case that (Bob is up and Bob is down). i.e.: ~(U ^ D) (where [[U]] = Bob is up, [[D]] = Bob is down, and where we use negation to represent "can't", ignoring the stronger "force" of canNOT, since it really can't be represented in propositional logic). Then we proved that, given this, when Bob is up, he isn't down, as follows: 1. ~(U ^ D) // premise (or: assumption) 2. U // premise Show ~D: *3. D // temporary assumption *4. U // send 2 *5. (U ^ D) // from 4, 3, by ^Intro *6. ~(U ^ D) // send 1 *7. ~D // 3, 5, 6, ~Intro 8. D // return 7 Those of you who preferred a representation using exclusive-or (xor) suggested this: U xor D i.e., either Bob is up or Bob is down, but not both. Translating that into our propositional-logic language, which does not have an "xor" connective, but only an inclusive-or connective, we get: (U v D) ^ ~(U ^ D) i.e.: Bob is up or Bob is down, but it's not the case that (Bob is up and Bob is down) Note that my representation is a well-formed subformula of this one! So, using this representation, here's the proof that, when Bob is up, he isn't down: 1. (U v D) ^ ~(U ^ D) // premise 2. U // premise Show ~D: *3. D // temporary assumption *4. U // send 2 *5. (U v D) ^ ~(U ^ D) // send 1 *6. ~(U ^ D) // 6, ^Elim *7. (U ^ D) // 4, 3, ^Intro *8. ~D // 3, 7, 6, ~Intro 9. ~D // return 8 Note that the two proofs differ in only inessential ways. From - Fri Feb 21 08:48:02 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Frivolity Date: Thu, 20 Feb 2003 10:22:00 -0500 Organization: The University at Buffalo Lines: 24 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1045754521 8680 128.205.35.2 (20 Feb 2003 15:22:01 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 20 Feb 2003 15:22:01 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:51 Caution: this post has nothing to do with course material. :) Prior to the afternoon recitation, Mr Goldfain and I were discussing an intriguing article on the correlations between intelligence and popularity in American middle- and high-schools. I don't agree with all the points in the essay, but it is an interesting read, in my opinion. Here is the URL: http://www.paulgraham.com/nerds.html After the first recitation, I was discussing Eclipse and CVS with some students. I recommend both tools, especially if you are doing Java development. Last night, I put together a short how-to on using CVS from Eclipse, and it is available online. The page briefly describes both tools and gives links for more information. I'm not a CVS or Eclipse support person however, so if you did ask me for more details I'd likely just point you back to the docs ;) http://www.cse.buffalo.edu/~pvg/cvs-with-eclipse.html From - Mon Feb 24 09:27:20 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW 3; MANY-VALUED LOGICS Date: Fri, 21 Feb 2003 14:58:59 -0500 (EST) Organization: Computer Science and Engineering Lines: 18 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1045857539 24819 128.205.34.3 (21 Feb 2003 19:58:59 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 21 Feb 2003 19:58:59 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:52 ------------------------------------------------------------------------- Subject: HW 3; MANY-VALUED LOGICS ------------------------------------------------------------------------- 1. The answers to HW 3 are now on the Web; go to the Homeworks page and click on the link. Be sure to read it, since it discusses some software you might be interested in trying out. 2. I have posted a webpage on many-valued logics: http://www.cse.buffalo.edu/~rapaport/563/many.valued.logic.html From - Tue Feb 25 09:36:28 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: STUDYING FOR MIDTERM Date: Mon, 24 Feb 2003 11:33:58 -0500 (EST) Organization: Computer Science and Engineering Lines: 23 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1046104438 29354 128.205.34.3 (24 Feb 2003 16:33:58 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 24 Feb 2003 16:33:58 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:53 ------------------------------------------------------------------------- Subject: STUDYING FOR MIDTERM ------------------------------------------------------------------------- Several students asked what reading to study from for the exam. For SNePS, re-read Shapiro & Rapaport 1987, Shapiro & Rapaport 1995, and Martins 2002. For propositional logic, (re-)read Rapaport (1992), "Logic, Propositional"; there's a link to it at: http://www.cse.buffalo.edu/~rapaport/563/fol.html For FOL, re-read B&L Ch. 2 (and you might as well re-read Ch. 1 while you're at it :-), and you might want to look at Rapaport (1992), "Logic, Predicate", also at the link above. Besides my reviewing for the exam on Friday, Paul will spend part of Wednesday's recitation reviewing. The exam is Monday. From - Tue Feb 25 09:36:45 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Office hours for Feb 28th cancelled Date: Tue, 25 Feb 2003 09:24:22 -0500 Organization: The University at Buffalo Lines: 6 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1046183065 13784 128.205.35.2 (25 Feb 2003 14:24:25 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 25 Feb 2003 14:24:25 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:54 I will be out of town on February 28th and will not be available for office hours. I will have my Wednesday office hour on Feb 26th as normal. -Paul From - Thu Feb 27 08:51:00 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW #4 CLARIFICATION Date: Wed, 26 Feb 2003 15:50:07 -0500 (EST) Organization: Computer Science and Engineering Lines: 14 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1046292607 27231 128.205.34.3 (26 Feb 2003 20:50:07 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 26 Feb 2003 20:50:07 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:55 ------------------------------------------------------------------------- Subject: HW #4 CLARIFICATION ------------------------------------------------------------------------- I understand that there is some unclarity in the way HW #4, problem 2, is stated. I *DO* want a proof, one way or the other, of whether unicorns are mythical, magical, or horned. I'll give you a hint: They are magical and horned, but you can't prove (from those premises) whether they are mythical. It is probably easiest, if long, to show these facts semantically, i.e., via truth tables. But I think you will find it worthwhile to struggle a bit with trying to prove the first two syntactically. From - Thu Feb 27 08:51:24 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: NEW ARTICLE ON K.R. Date: Wed, 26 Feb 2003 16:54:18 -0500 (EST) Organization: Computer Science and Engineering Lines: 19 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1046296458 3422 128.205.34.3 (26 Feb 2003 21:54:18 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 26 Feb 2003 21:54:18 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:56 ------------------------------------------------------------------------- Subject: NEW ARTICLE ON K.R. ------------------------------------------------------------------------- There is a new article on knowledge representation by our very own Stuart C. Shapiro: Stuart C. Shapiro, Knowledge Representation. In Lynn Nadel, Ed. Encyclopedia of Cognitive Science, Volume 2, Macmillan Publishers Ltd., 2003, 671-680 I have added this to the KR Resources webpage at: http://www.cse.buffalo.edu/~rapaport/563/krresources.html and it is also available directly from: http://www.cse.buffalo.edu/~shapiro/Papers/kr.pdf From - Tue Mar 4 09:52:09 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: NO RECITATIONS THIS WEEK Date: Mon, 3 Mar 2003 11:03:01 -0500 (EST) Organization: Computer Science and Engineering Lines: 7 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1046707381 15801 128.205.34.3 (3 Mar 2003 16:03:01 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 3 Mar 2003 16:03:01 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:57 ------------------------------------------------------------------------- Subject: NO RECITATIONS THIS WEEK ------------------------------------------------------------------------- There will be no recitations this week (i.e., on Wednesday, March 5). I will hand back and review the midterm in lecture that day. From - Tue Mar 4 09:52:49 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: An Invalid Argument Date: Mon, 3 Mar 2003 15:38:31 -0500 Organization: The University at Buffalo Lines: 22 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1046723926 9674 128.205.35.2 (3 Mar 2003 20:38:46 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 3 Mar 2003 20:38:46 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:58 In grading homework #4 submissions, I have found many students to be making a fallacious argument of this form: 1. P -> Q // Given *2. P // Temporary assumption *3. P -> Q // Send 1 *4. Q // ->Elim on 2,3 5. Q // Return 4 Hopefully, it is clear to you now why this is false. At step 5, all we can return from the subproof is P->Q, which is what we were given in step 1, and so we have made no progress in the proof. To use an example: It is true that if you work hard in class you will pass (P->Q). Assume that you work hard in class (P). We know that if you work hard in class you will pass (P->Q). Therefore you will pass. If this were valid propositional logic, no one would ever fail a course! From - Tue Mar 4 09:53:42 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Comments on Homework 4 Date: Mon, 3 Mar 2003 16:57:59 -0500 Organization: The University at Buffalo Lines: 31 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1046728681 16198 128.205.35.2 (3 Mar 2003 21:58:01 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 3 Mar 2003 21:58:01 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:59 Since we have no recitations this week, I will use the newsgroup as a forum for making some general observations about homework #4, which will be returned on Wednesday. 1) Please see my previous newsgroup posting regarding the fallacious argument that many people used in the homework. 2) In the syntactic proofs of question 2, it is illegal to use rules that were not given unless you prove them syntactically. For example, it is true that (P -> Q) is logically equivalent to (~P V Q), but unless you prove this in the syntactic domain, you can not use it in the syntactic proof. 3) Regarding the problem of showing that "the unicorn is mythical": Let [[M]] be that unicorns are mythical. Doing a truth table analysis, we see that when the premises are true, M can be false -- however, this does *not* tell us that [[M]] is unprovable! In fact, it could be the case [[~M]] is provable, except that we see that when the premises are true, it could also be the case that [[M]] is false. It is the case that, because [[M]] can be true and false when the premises are true, that [[M]] is not provable syntactically, as shown in the semantic analysis. 4) In the third question, we are given that "if P then Q else R" is a wff, and asked to give a truth table for it. It does not make sense, then, to give another wff and give a truth table for it, even if it shares the same truth values as "if P then Q else R". As always, if you have any questions about the grading, feel free to come to my office hours. From - Wed Mar 5 09:11:55 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MIDSEMESTER GRADE AVERAGES Date: Tue, 4 Mar 2003 14:13:00 -0500 (EST) Organization: Computer Science and Engineering Lines: 86 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1046805180 3081 128.205.34.3 (4 Mar 2003 19:13:00 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 4 Mar 2003 19:13:00 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:60 ------------------------------------------------------------------------- Subject: MIDSEMESTER GRADE AVERAGES ------------------------------------------------------------------------- On Wednesday, Mar. 5 (tomorrow), I will return the graded midterm exams, and give you the statistics. In the meantime, to give you an idea of how you are doing overall, in time for the last R date (this Friday), here are the class averages and your individual averages, sorted by course (463, 563) and by the last 4 digits of your person number. Please bring any errors to my attention. ------------------------------------------------------------------------- CSE 463 Spring 2003 [[HW]] = average of HW grades, with lowest dropped [[Proj]] = project grade ([[X]] = we have no grade for you) [[MT]] = midterm grade Avg := (HW + Proj + MT)/3 If your Avg grade is lower than you would like it to be, please see me during office hours (or make an appointment). Last 4 digits Person# HW Proj MT Avg 0356 A- X X D+ 1626 B+ A A- A- 2728 A A B A- 4509 B C C- C+ 4790 D B- C C 4843 B A C+ B 4912 D+ D X D 6327 B+ A C B 8070 B- B C- C+ 8081 B+ C- C C+ 8673 B A C B 8748 C+ C- B C+ 8792 B+ B+ C+ B 9859 B+ X B C 463 class average B B- C+ B- ------------------------------------------------------------------------- CSE 563 Spring 2003 [[HW]] = average of HW grades, with lowest dropped [[Proj]] = project grade ([[X]] = we have no grade for you) [[MT]] = midterm grade Avg := (HW + Proj + MT)/3 If your Avg grade is lower than you would like it to be, please see me during office hours (or make an appointment). Last 4 digits Person# HW Proj MT Avg 0252 A- A A A 1507 B B C+ B- 1545 A- A B- B+ 1803 B A B- B+ 2504 B+ B A B+ 2731 B+ A C+ B+ 3659 A- B B- B 4107 A- B B- B 4696 B B C+ B- 4829 B B- C B- 5692 B+ A B- B+ 5727 A- A B A- 5873 B- D C+ C 6813 B B B+ B 7216 A A B A- 8072 A B B+ B+ 8192 A- A A A 8707 B+ A C+ B+ 9562 A- A A A 563 class average B+ B+ B B+ From - Tue Mar 18 14:20:05 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: HW4 Availability Date: Thu, 6 Mar 2003 10:22:01 -0500 Organization: The University at Buffalo Lines: 10 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1046964122 14587 128.205.35.2 (6 Mar 2003 15:22:02 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 6 Mar 2003 15:22:02 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:61 I will be in Trailer B at 1.30 for a meeting. I will bring the graded Homework 4 submissions with me, in case you need to get yours today. Otherwise, I will have them in lecture on Friday and will distribute them. There is a CSEGSA meeting at 12.30 in Bell 242, and all grad students are welcome to attend. From - Tue Mar 18 14:20:23 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROOF GIVER (PROJ 2) Date: Fri, 7 Mar 2003 11:24:09 -0500 (EST) Organization: Computer Science and Engineering Lines: 12 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1047054249 3346 128.205.34.3 (7 Mar 2003 16:24:09 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 7 Mar 2003 16:24:09 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:62 ------------------------------------------------------------------------- Subject: PROOF GIVER (PROJ 2) ------------------------------------------------------------------------- The pdf file containing the chapter on how to construct Proof Giver is now online. Go to the Project 2 webpage, and click on the chapter title (or use the links below). http://www.cse.buffalo.edu/~rapaport/563/proj2.html http://www.cse.buffalo.edu/~rapaport/563/proofgiver.pdf From - Tue Mar 18 14:20:43 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Updated instructions on using Eclipse Date: Fri, 7 Mar 2003 12:57:06 -0500 Organization: The University at Buffalo Lines: 14 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1047059828 11157 128.205.35.2 (7 Mar 2003 17:57:08 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 7 Mar 2003 17:57:08 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:63 I have updated my webpage that gives instructions on how to use CVS through Eclipse using the CSE machines. Since Eclipse is available for many platforms (including Microsoft Windows), it may be something for you to consider when choosing a development environment for Project 2. E.g., I have a CVS repository with all of my research code in it, and by keeping the code in the repository, I can work on it from Solaris here or from Linux or Windows at home with exactly the same interface. The issue of porting becomes moot. The URL is: http://www.cse.buffalo.edu/~pvg/cvs-with-eclipse.html From - Tue Mar 18 14:21:12 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROPER SUBFORMULA Date: Mon, 17 Mar 2003 13:10:54 -0500 (EST) Organization: Computer Science and Engineering Lines: 52 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1047924654 2999 128.205.34.3 (17 Mar 2003 18:10:54 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 17 Mar 2003 18:10:54 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:64 ------------------------------------------------------------------------- Subject: PROPER SUBFORMULA ------------------------------------------------------------------------- A student writes: >Would you tell me what is the definition or example of proper subformula? Here is a recursive definition of "proper subformula" for our system of propositional logic. (I will use "subwff" instead of "subformula".) Let P, Q, R be wffs. Then: If P is a proper subwff of Q, and Q is a proper subwff of R, then P is a proper subwff of R. If R is -P, then P is a proper subwff of R. If R is (P^Q), then P and Q are proper subwffs of R. If R is (PvQ), then P and Q are proper subwffs of R. If R is (P>Q), then P and Q are proper subwffs of R. If R is (P=Q) [i.e., (P triplebar Q)], then P and Q are proper subwffs of R. Nothing else is a proper subwff. An example: The proper subwffs of: (-P > -(Q ^ R)) v ((S ^ T) v (U ^ P)) are: (-P > -(Q ^ R)) ((S ^ T) v (U ^ P)) -P -(Q ^ R) (S ^ T) (U ^ P) P (Q ^ R) S T U Q R You can make a nice (recursive) tree diagram with the main wff at the root, and the proper subwffs as children; the leaves will be the atomic wffs. From - Tue Mar 18 14:22:15 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Project 2 Submission Instructions and Requirements Date: Mon, 17 Mar 2003 14:13:22 -0500 Organization: The University at Buffalo Lines: 38 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1047928404 10131 128.205.35.2 (17 Mar 2003 19:13:24 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 17 Mar 2003 19:13:24 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:65 Your Project 2 program submissions are required to compile and run on pollux. It is your responsibility to ensure that your program works in the CSE computing environment. You are required to submit the documented source code as well as a README file that explains how to compile and execute your program on the CSE computing environment. You may use makefiles and ant buildfiles to facilitate compilation. When you are ready to submit your program, you should do so using the 'submit_cse563' command. From the shell prompt, issue the submit command followed by all of the files you wish to submit. For example, if your solution was written in Java, then you might issue a command such as: % submit_cse563 *.java README where I am using '%' as a unix prompt. This will submit all Java source code files in the current directory along with the README file. When you submit your files, they are copied to another location from where the professor and I may look at them. If you run the submit program again, it will blindly overwrite any other files you had previously submitted. This means that if you make an improper submission, you can always submit again to clobber the old one; however, it also means that you must not submit any files after the deadline, since new timestamps are created for each submission. If your submission is made up of multiple source files, it is polite to submit an archive file (tar or jar) that contains all of these files, especially if they are distributed over several directories. Your README file must then indicate the proper commands to extract your source code from the archive. Following this protocol is not required, but students in 400/500 level computer science should be able to effectively distribute their projects :) From - Tue Mar 18 14:22:28 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: LOGIC vs. SEMANTIC NETWORKS Date: Tue, 18 Mar 2003 08:54:55 -0500 (EST) Organization: Computer Science and Engineering Lines: 12 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1047995695 13293 128.205.34.3 (18 Mar 2003 13:54:55 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Mar 2003 13:54:55 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:66 ------------------------------------------------------------------------- Subject: LOGIC vs. SEMANTIC NETWORKS ------------------------------------------------------------------------- This may be a duplicate posting. I have put a document on our website called "Logic vs. Semantic Networks", which lists some readings that compare the two forms of KRR systems. http://www.cse.buffalo.edu/~rapaport/563/logic.vs.semnets.html From - Tue Mar 18 14:22:47 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: REVISED SYLLABUS Date: Tue, 18 Mar 2003 09:10:09 -0500 (EST) Organization: Computer Science and Engineering Lines: 17 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1047996609 14610 128.205.34.3 (18 Mar 2003 14:10:09 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Mar 2003 14:10:09 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:67 ------------------------------------------------------------------------- Subject: REVISED SYLLABUS ------------------------------------------------------------------------- I have finished revising the syllabus. The updated version, which more accurately reflects both what we have already done as well as what I plan to do for the rest of the semester (more or less), including new reading assignments!, is now on the Web at: http://www.cse.buffalo.edu/~rapaport/563/syl.html Please note that the *correct* readings for the next several weeks is: B&L, Chs. 2, 4, 5, and 6 (and *not* exactly what I announced in lecture on Monday). From - Tue Mar 18 14:23:07 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MIDSEMESTER COURSE EVALUATION Date: Tue, 18 Mar 2003 09:30:09 -0500 (EST) Organization: Computer Science and Engineering Lines: 81 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1047997809 16245 128.205.34.3 (18 Mar 2003 14:30:09 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Mar 2003 14:30:09 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:68 ------------------------------------------------------------------------- Subject: MIDSEMESTER COURSE EVALUATION ------------------------------------------------------------------------- I have read your midsemester course evaluation comments; thank you for writing them. Here are some quick reactions, but I am happy to discuss any of these (or other topics) further, either by email, newsgroup postings, or in person. 1. In general, you seem happy with the course so far, with a few exceptions noted below. 2. The most serious issue surrounds your not having enough guidance/help/etc. on HWs and projects, especially in recitation. Several of you requested more worked-out sample problems or non-graded exercises, in part to supplement for the missing exercises in the B&L text. We'll try to do better on this. In the meantime, don't forget that you have access to 3 supplementary texts, all of which will have more examples in them: Russell & Norvig, Sowa, and Torsun. 3. Several of you pointed out that the syllabus is misleading; that has now been corrected (see my previous posting about the revised syllabus). Again, I apologize for this, but it's much harder to create a syllabus for what is essentially a brand-new course than it seems at first glance! 4. Some of you wanted more programming projects; me, too. We'll see. In any case, Project 2 should be keeping you busy! 5. Some of you prefer to cover more topics than just logic, while others of you thought we spent too much time on semantic networks. Given the apparent inconsistency between these, I suspect I'm doing OK on average. However, one reason there's a lot of logic is that this course *replaces* CSE 572 (Knowledge-Based AI), and therefore has to cover quite a bit of logic, which is (here's another reason) the foundation of all KRR. Other topics *will* be covered (see the revised syllabus), and will also be covered in CSE 663 next Fall. 6. Some of you wanted more information on how SNePS does reasoning. For this, you should take a look at some of the papers in the SNeRG Bibliography at http://www.cse.buffalo.edu/sneps/Bibliography/ in particular: 1977-1, 3 1978-1 1980-1, 2, 3, 5 1981-3, 9*, 12 1982-7 (* by Rohini Srihari !) 7. Another apparent inconsistency suggesting that on average all is well is that some of you complained that there's not enough time in lecture discussing "off-subject" topics, while others of your liked the fact that we take the time to do just that :-) 8. Some of you felt the grading scheme was too rigid or unfair or that it was too hard for you to improve your grades. I urge you to study carefully my "Grading Principles" webpage, http://www.cse.buffalo.edu/~rapaport/grading.html and suggest improvements. I will try to be more flexible. 9. Finally, some of you asked why HWs and projects are due at the beginning and not at the end of lecture. Simple: From some 30 years of teaching, I have learned that the way to ensure that students will come late and miss most of a lecture is to collect assignments at the *end* of class :-) From - Tue Mar 18 14:23:19 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: Len Talmy lecture Date: Tue, 18 Mar 2003 11:28:39 -0500 (EST) Organization: Computer Science and Engineering Lines: 16 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048004919 27007 128.205.34.3 (18 Mar 2003 16:28:39 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Mar 2003 16:28:39 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:69 sunyab.cse.740:30 ------------------------------------------------------------------------- Subject: Len Talmy lecture ------------------------------------------------------------------------- Some of you might be interested in the following presentation by Len Talmy; it is highly relevant to KR! Jeff Galko writes: I was just writing to give you some advance notice of a talk that is coming up on campus that you and/or your students may find useful. Len Talmy is going to be speaking in front of the IGERT colloquium on Friday, April 4 at 11 am in Park 141 (Philosophy seminar room). The title of his talk is "How Language Structures Concepts." Everyone is welcomed, but keep in mind Park 141 does not have a very large seating capacity. From - Wed Mar 19 13:45:41 2003 Path: acsu.buffalo.edu!not-for-mail From: "William J. Rapaport" Newsgroups: sunyab.cse.563 Subject: Re: Project 2 Submission Instructions and Requirements Date: Tue, 18 Mar 2003 14:28:53 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 37 Sender: rapaport@buffalo.edu Message-ID: <3E777375.C76EDE37@cse.buffalo.edu> References: NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Trace: prometheus.acsu.buffalo.edu 1048015733 13719 128.205.34.3 (18 Mar 2003 19:28:53 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Mar 2003 19:28:53 +0000 (UTC) X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.563:70 Paul V Gestwicki wrote: > > Your Project 2 program submissions are required to compile and run on > pollux. It is your responsibility to ensure that your program works > in the CSE computing environment. > > You are required to submit the documented source code as well as a > README file that explains how to compile and execute your program on > the CSE computing environment. You may use makefiles and ant > buildfiles to facilitate compilation. Just to clarify (and I've updated the Project 2 webpage to reflect this): You must turn in *two* things for Project 2: 1. Your written report, which should include annotated demos *and* commented code 2. A "submit"ted copy of your program that we can run, in order to test it. Advice for those who don't like the "submit" facility, from our CSE lab staff: You should test your programs on UNIX before "submit"ting them, regardless of what environment you choose to do the bulk of your program development in. This will force you to transfer your files to UNIX towards the end of your development cycle. If you rely on the core Microsoft development suite, that will force us to grade your work on a Windows machine, since Windows-based environments have "extensions" that are incompatible with other development environments. From - Wed Mar 19 13:45:58 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW #5 CLARIFICATION Date: Tue, 18 Mar 2003 14:33:35 -0500 (EST) Organization: Computer Science and Engineering Lines: 16 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048016015 14076 128.205.34.3 (18 Mar 2003 19:33:35 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 18 Mar 2003 19:33:35 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:71 ------------------------------------------------------------------------- Subject: HW #5 CLARIFICATION ------------------------------------------------------------------------- Problem 2 is probably easier to do in **propositional** logic than in FOL. In most, if not all, of the sentences, the crucial point is that the *connectives* are odd. But note that propositional logic is, in fact, entirely contained within FOL: As the B&L text points out, a 0-place predicate is just a propositional-logic wff! So, for example, for sentence 2(a), you do NOT need to worry about how to represent things like "one more outburst like that" or "you will be in contempt of court". This issue is really whether that sentence is really a conjunction (as it appears to be on the surface) or something else. From - Thu Mar 20 09:29:23 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Re: HW #5 CLARIFICATION Date: Wed, 19 Mar 2003 14:00:20 -0500 Organization: The University at Buffalo Lines: 11 Sender: pvg@buffalo.edu Message-ID: References: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1048100422 11536 128.205.35.2 (19 Mar 2003 19:00:22 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 19 Mar 2003 19:00:22 +0000 (UTC) In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.563:72 As an official response / clarification to some of the questions from the 11 o'clock recitation: There is technically nothing wrong with using constants to represent something like "Computer Science", since constants are 0-ary functions (not 0-ary predicates, as I had mistakenly said [and thanks again to the student who corrected my oversight]). From - Thu Mar 20 09:31:33 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: FUNCTION SYMBOLS VS. PREDICATES Date: Wed, 19 Mar 2003 14:09:34 -0500 (EST) Organization: Computer Science and Engineering Lines: 108 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048100974 12435 128.205.34.3 (19 Mar 2003 19:09:34 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 19 Mar 2003 19:09:34 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:73 ------------------------------------------------------------------------- Subject: FUNCTION SYMBOLS VS. PREDICATES ------------------------------------------------------------------------- I've been told that there's some confusion among some of you about the difference between function symbols and predicates in FOL. If you are NOT confused, you probably shouldn't read this posting, since it may confuse you! But if you ARE confused, maybe it will help. First, don't forget to distinguish between syntax and semantics, in this case, between function symbols and predicates, on the one hand, and functions and properties/relations, on the other hand: SYNTAX SEMANTICS function symbols functions predicates properties and relations Let's concentrate on semantics (or ontology) first: A function is a set of input/output pairs such that the same input always yields the same output (i.e., you'll never have different outputs coming from the same input). A typical function is the doubling function: If the input is an integer, the output is twice the input. Another function is the one that takes as input a person and returns as output the father of that person. A property, mathematically (or "extensionally") speaking, is a set. An n-place relation, mathematically (or "extensionally") speaking, is a set of n-tuples. (Note that, on this view, a property is just a 1-place relation.) A typical example of a property thus understood might be the set of all red things; this would be the property "red". A typical example of a 2-place relation is the set of all ordered pairs of integers such that the first member of the pair is less than the second member; this would be the relation "<". There's another view of properties and relations that you should be aware of: A property, "intensionally" speaking, is some aspect or feature of a thing. So, the property of being red is that feature of a thing that reflects light of a certain wavelength. (Presumably, all the members of the extensional set of red things have this feature.) The An n-place relation, "intensionally" speaking, is some relationship that obtains among the n things. So, the relation of one integer being less than another is the relationship that obtains between the members of the ordered pairs in the extensional "<" relation. The mathematical, or "extensional", version is easier to understand, so I'll stick with that in what follows. I hope it's clear that functions and n-place relations are different things. (But, if you'd like, I can easily confuse you by pointing out that, mathematically, a function is just a 2-place relation, since it's a set of ordered pairs!) Now back to syntax: Function *symbols* are names of functions, and n-place *predicates* are names of n-place relations. So, "father-of" might be the name of one of the functions I mentioned above, and "double" might be the name of the other. We can then write things like this: father-of(George W. Bush) = George H.W. Bush double(2) = 4 Note that what I've just written are wffs of FOL! Each involves the 2-place predicate "=", which forms a wff along with two terms. In the first example, the term on the left-hand side of "=" is a molecular term: father-of(George W. Bush) constructed by taking the atomic constant term "George W. Bush" and forming an expression of the form: f(t). And the term on the right-hand side is an atomic constant term "George H.W. Bush". In the second example, the term on the LHS of "=" is a molecular term: double(2) constructed by taking the atomic constant term "2" and forming an expression of the form: f(t). And the term on the right-hand side is an atomic constant term "4". If I want to express a property of Bush, I could say something like: President(George W. Bush) If the term "George W. Bush" names George W. Bush, and the predicate "President" names the property of being a President of the US (or, mathematically, names the set {George Washington, John Adams, ..., Abraham Lincoln, ..., Bill Clinton, George W. Bush}), then this wff says that Bush has that property. (Just to confuse you, however, some people like to say that predicates name binary functions that take members of the domain as input and outputting a truth value, so "President(George W. Bush)" = true. But I wouldn't want to confuse you :-) The only remaining possible confusion is that the grammatical syntax for functions symbols and predicates is the same: symbol(term1, ..., term-n) But when you formally specify a language for FOL, you must carefully indicate which symbols are to be considered as function symbols and which are predicates. There should never be any ambiguity in a formal language (only in natural languages, like English). From - Thu Mar 20 09:31:44 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SAMPLE TRANSLATIONS FROM ENGLISH TO F.O.L. Date: Wed, 19 Mar 2003 14:28:03 -0500 (EST) Organization: Computer Science and Engineering Lines: 116 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048102083 14200 128.205.34.3 (19 Mar 2003 19:28:03 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 19 Mar 2003 19:28:03 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:74 ------------------------------------------------------------------------- Subject: SAMPLE TRANSLATIONS FROM ENGLISH TO F.O.L. ------------------------------------------------------------------------- First, on the issue of translating from English to FOL (i.e., on representing English sentences in FOL), see the references cited in my webpage "TRANSLATING FROM ENGLISH TO A FIRST-ORDER LANGUAGE", at http://www.cse.buffalo.edu/~rapaport/572/S02/eng.to.logic.html Second, here are some sample translations. The English sentences are from a logic textbook by Lewis Carroll (yes, the author of "Alice in Wonderland"!). First, here are some sentences to translate: 1. No kitten who loves fish is unteachable. 2. No kitten without a tail will play with a gorilla. 3. Kittens with whiskers always love fish. 4. No teachable kitten has green eyes. 5. No kittens have tails unless they have whiskers. Therefore: 6. No kitten with green eyes will play with a gorilla. Now for the translations. Let [[K]] = is a kitten [[L]] = loves fish [[T]] = is teachable [[H]] = has a tail [[P]] = plays with a gorilla [[W]] = has whiskers [[G]] = has green eyes I will use "E" for the existential quantifier and "A" for the universal quantifier; I will use "-" for negation, "^" for conjunction, "v" for inclusive disjunction, ">" for the material conditional, and "<->" for the biconditional. I will also omit parentheses where they are not needed. 1. -Ex[Kx ^ Lx ^ -Tx] 2. -Ex[Kx ^ -Hx ^ Px] 3. Ax[(Kx ^ Wx) > Lx] 4. -Ex[Kx ^ Tx ^ Gx] 5. Ax[Kx > (Wx <-> Hx)] Therefore: 6. -Ex[Kx ^ Gx ^ Px] Some comments: A. The test of whether these representations are OK is if you can prove 6 from 1-5, either semantically or syntactically. B. Translating "unless" is tricky. Construct a truth table: P Q P unless Q T T F T F T F T T F F F According to this truth table, "P unless Q" is equivalent to "P xor Q" (or to: -(P <-> Q)). There may be a "weaker" reading of "unless", which makes the conditional only go in one direction. See which one is actually needed in the proof of 6 from 1-5 to see what that weaker reading is. From - Thu Mar 20 09:31:56 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: Re: SAMPLE TRANSLATIONS FROM ENGLISH TO F.O.L. Date: Thu, 20 Mar 2003 09:21:53 -0500 (EST) Organization: Computer Science and Engineering Lines: 95 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048170113 24857 128.205.34.3 (20 Mar 2003 14:21:53 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 20 Mar 2003 14:21:53 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:75 ------------------------------------------------------------------------- Subject: Re: SAMPLE TRANSLATIONS FROM ENGLISH TO F.O.L. ------------------------------------------------------------------------- A student writes: > I solved the sample translations from English to FOL given by you. In > that I am not convinced by the solution of the 5th Statement. > > 5. No kittens have tails unless they have whiskers. > > Your sol: Ax[Kx > (Wx <-> Hx)] > > I came up with : Ax[Kx > (Wx > Hx)] > As per my knowledge P unless Q can be translated as -Q > P. Can you > throw some > light explaining your > approach to the solution ? Is my solution correct ? OK: Let's rethink this. As I said in my posting, there's a "strong" and a "weak" interpretation of English "unless". I gave the truth table for the strong reading, which leads to the representation using the biconditional. Your interpretation is the "weak" reading. The difference focuses on the last lines of the two truth tables: 2 possible truth tables for "P unless Q" P Q strong "P unless Q" weak "P unless Q" ------------------------------------------------------------------------- T T F F T F T T F T T T F F F T Note that the strong intrepretation is logically equivalent to "-(P <-> Q)" and the weak interpretation is logically equivalent to "-(P ^ Q)". These differ only in the last line. The first 3 lines should be clear. But if both P and Q are F, there's some ambiguity. If P is the case UNLESS Q is the case, and Q is not the case, then it seems to me that something's wrong, since P is supposed to be the case UNLESS Q isn't. So, in this case, "P unless Q" seems to me to be false. But on a different intuition, someone might argue that the "unless" sentence is T. (Take a look at HW #5, problem 1i, for a case like this.) To relate this to the case at hand, we actually need to consider slightly different truth tables, since our case concerns a sentence of the form "-R v Q" (kittens don't have tails unless they have whiskers): R -R Q strong "-R unless Q" weak "-R unless Q" ------------------------------------------------------------------------- T F T T T T F F F T F T T F F F T F T T To see more clearly what's going on, I'm going to re-arrange these truth tables a bit: -R Q strong "-R unless Q" weak "-R unless Q" ------------------------------------------------------------------------- T T F F T F T T F T T T F F F T Now we can see that strong "-R unless Q" is logically equivalent to "-(-R <-> Q)" or, if you prefer, to "-R xor Q", and that weak "-R unless Q" is logically equivalent to "-(-R ^ Q)" or, if you prefer, to "R v -Q", or, if you prefer, to "Q > R". > Can you suggest me > solution in terms of Ex (Existential quantification). Note that: my solution = Ax[Kx > (Wx <-> Hx)] your solution = Ax[Kx > (Wx > Hx)] Since AxP = -Ex-P, we could have said: -Ex-[Kx > (Wx <-> Hx)] (strong) or -Ex-[Kx > (Wx > Hx)] (weak) or anything logically equivalent to either of these. From - Fri Mar 21 09:41:37 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW #5 GRADING SCHEME Date: Thu, 20 Mar 2003 09:42:11 -0500 (EST) Organization: Computer Science and Engineering Lines: 42 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048171331 26470 128.205.34.3 (20 Mar 2003 14:42:11 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 20 Mar 2003 14:42:11 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:76 Grading scheme for HW #5: #1. 10 sentences, 3 points each, total = 30 points 0 = not done 1 = syntactically incorrect 2 = syntactically correct, but semantically incorrect 3 = syntactically & semantically correct #2. 6 sentences, 6 points each, total = 36 points (i) translation that preserves intended English meaning 0 = not done 1 = syntactically incorrect 2 = syntactically correct, but semantically incorrect 3 = syntactically & semantically correct (ii) translation that is straightforwardg 0 = not done 1 = syntactically incorrect 2 = syntactically correct, but semantically incorrect 3 = syntactically & semantically correct Grand total = 66 points Letter 463 both 563 ------ --- ---- --- A 63-66 A- 60-62 B+ 56-59 B 53-55 B- 49-52 C+ 45-48 C 38-44 23-44 C- 30-37 D+ 23-29 D 12-22 F 0-11 From - Mon Mar 24 09:25:44 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: CONTEXTUAL VOCABULARY ACQUISITION Date: Fri, 21 Mar 2003 11:00:12 -0500 (EST) Organization: Computer Science and Engineering Lines: 68 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048262412 12009 128.205.34.3 (21 Mar 2003 16:00:12 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 21 Mar 2003 16:00:12 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:77 sunyab.cse.740:31 CENTER FOR COGNITIVE SCIENCE University at Buffalo, State University of New York Wednesday, March 26, 2003 2:00 pm - 4:00 pm 280 Park Hall William Rapaport, Ph.D. Department of Computer Science and Engineering University at Buffalo CONTEXTUAL VOCABULARY ACQUISITION: From Algorithm to Curriculum" No doubt you have on occasion read some text containing an unfamiliar word, but you were unable or unwilling to find out from a dictionary or another person what the word meant. Nevertheless, you might, consciously or not, have figured out a meaning for it. Suppose you didn't, or suppose your hypothesized meaning was wrong. If you never see the word again, it may not matter. However, if the text you were reading were from science, mathematics, engineering, or technology, not understanding the unfamiliar term might seriously hinder your subsequent understanding of the text. If you do see the word again, you will have an opportunity to revise your hypothesis about its meaning. The more times you see the word, the better your definition will become. And if your hypothesis development were deliberate, rather than "incidental", your command of the new word would be stronger. This talk discusses a research project that is developing and applying algorithms for computational contextual vocabulary acquisition (CVA): learning the meaning of unknown words from context. We are trying to unify a disparate literature on the topic of CVA from psychology, first- and second-language acquisition, and reading science, in order to help develop these algorithms. We are using the knowledge gained from the computational CVA system to build an educational curriculum for enhancing students' abilities to use CVA strategies in their reading of science texts at the middle-school and college undergraduate levels. The knowledge gained from case studies of students using our CVA techniques will feed back into further development of our computational theory. Research done jointly with Michael W. Kibby, Department of Learning & Instruction, Center for Literacy & Reading Instruction, State University of New York at Buffalo. Refreshments will be served Everybody welcome For more information please contact: Center for Cognitive Science, 652 Baldy Hall, UB, P: (716) 645-3794 or visit http://www.cogsci.buffalo.edu Heike Jones Administrative Assistant University at Buffalo Center for Cognitive Science 652 Baldy Hall Buffalo, NY 14260 P: (716) 645-3794 F: (716) 645-3825 Email: hhjones@buffalo.edu URL: http://www.cogsci.buffalo.edu From - Mon Mar 24 09:25:56 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROJECT 2 CORRECTION !!! Date: Mon, 24 Mar 2003 09:22:57 -0500 (EST) Organization: Computer Science and Engineering Lines: 25 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048515777 5705 128.205.34.3 (24 Mar 2003 14:22:57 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 24 Mar 2003 14:22:57 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:78 ------------------------------------------------------------------------- Subject: PROJECT 2 CORRECTION !!! ------------------------------------------------------------------------- There appears to be a bug in the Proof-Giver algorithm for Project 2. The following modification seems to fix the bug: Add a "step 0" to the OBTAIN Q procedure, just before the current step 1: ------------------------------------------------------------------------- 0. If the line containing Q has fewer asterisks than the desired result and if Q is of the form (X > Y), then insert *SEND,[Q] before DERIVE DR in the task list. ------------------------------------------------------------------------- Note that unlike other steps, you don't delete or replace the "DERIVE" task; instead, you put a task just before it, but you keep it there. You will need this for both problems that your program should work on. From - Wed Mar 26 08:45:12 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: CLAUSE FORM UPDATED Date: Tue, 25 Mar 2003 09:46:26 -0500 (EST) Organization: Computer Science and Engineering Lines: 16 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048603586 7007 128.205.34.3 (25 Mar 2003 14:46:26 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 25 Mar 2003 14:46:26 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:79 ------------------------------------------------------------------------- Subject: CLAUSE FORM UPDATED ------------------------------------------------------------------------- While trying to do HW 6 last night, I discovered that it can be made a bit easier by adding an optional section to step 3 (conversion to CNF). Accordingly, I've modifed the algorithm to include this, as well as the missing "repeat/end" control structure in step 2 (conversion to SNF). The revised algorithm is now on our website at the location of the old one: http://www.cse.buffalo.edu/~rapaport/563/clause-form.pdf http://www.cse.buffalo.edu/~rapaport/563/clause-form.ps From - Wed Mar 26 08:45:33 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW 6 MODIFICATION Date: Tue, 25 Mar 2003 09:48:43 -0500 (EST) Organization: Computer Science and Engineering Lines: 13 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048603723 7320 128.205.34.3 (25 Mar 2003 14:48:43 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 25 Mar 2003 14:48:43 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:80 ------------------------------------------------------------------------- Subject: HW 6 MODIFICATION ------------------------------------------------------------------------- While doing HW 6 last night, I also decided that problem 10, while not intrinsically more difficult than any of problems 1-9 (and I warn you, problem 1 is LONG!), is considerably longer than any of them (including #9!). Consequently, you do not have to do it. I will, however, offer it as an extra-credit problem: If you do it, and if you get it completely correct, I will use it to replace your lowest HW grade :-) From - Wed Mar 26 08:46:50 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW 6 UPDATE NOW ON THE WEB Date: Tue, 25 Mar 2003 10:47:00 -0500 (EST) Organization: Computer Science and Engineering Lines: 9 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048607220 12353 128.205.34.3 (25 Mar 2003 15:47:00 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 25 Mar 2003 15:47:00 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:81 ------------------------------------------------------------------------- Subject: HW 6 UPDATE NOW ON THE WEB ------------------------------------------------------------------------- I have update HW 6 to reflect the new extra-credit portion of it. For the new version, go to: http://www.cse.buffalo.edu/~rapaport/563/hw06.pdf From - Wed Mar 26 08:47:16 2003 Path: acsu.buffalo.edu!not-for-mail From: "William J. Rapaport" Newsgroups: sunyab.cse.563 Subject: Re: HOW TO REPRESENT ADVERBS (AND VAGUE ONES AT THAT) Date: Tue, 25 Mar 2003 11:42:33 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 32 Sender: rapaport@buffalo.edu Message-ID: <3E8086F9.9A5ED1C4@cse.buffalo.edu> References: NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Trace: prometheus.acsu.buffalo.edu 1048610554 16615 128.205.34.3 (25 Mar 2003 16:42:34 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 25 Mar 2003 16:42:34 +0000 (UTC) X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.563:82 "William J. Rapaport" wrote: In a previous article: > ------------------------------------------------------------------------- > Subject: HOW TO REPRESENT ADVERBS (AND VAGUE ONES AT THAT) > ------------------------------------------------------------------------- I said that if you were interested in how to represent adverbs, you might... > > Do some reading (also known as "research") about the representation of > adverbial modifiers in the linguistics and the philosophy literature. > The most widely cited article, by both linguists and philosophers is: > > Davidson, Donald (1967), "The Logical Form of Action Sentences", in > Nicholas Rescher (ed.), _The Logic of Decision and Action_ (Pittsburgh: > University of Pittsburgh Press). Reprinted in in D. Davidson, > _Essays on Actions and Events_ (Oxford: Clarendon Press). > > There are also a couple of SNePS papers on aspects of this problem: > > R. Wyatt. Kinds of opacity and their representations. In D. Kumar, > editor, Current Trends in SNePS-Semantic Network Processing System: > Proceedings of the First Annual SNePS Workshop, > pages 123-144, Buffalo, NY, 1990. Springer-Verlag. > > Wyatt, Richard (1993), ``Reference and Intensions,'' {\it Journal of > Experimental and Theoretical Artificial Intelligence\/} 5:~263--271. The Davidson paper and the Wyatt 1990 paper are now online, via the UB Library Course Reserve. From - Wed Mar 26 08:47:49 2003 Path: acsu.buffalo.edu!not-for-mail From: "William J. Rapaport" Newsgroups: sunyab.cse.563 Subject: Re: HW 6 MODIFICATION Date: Wed, 26 Mar 2003 08:46:21 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 14 Sender: rapaport@buffalo.edu Message-ID: <3E81AF2D.DE50D799@cse.buffalo.edu> References: NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Trace: prometheus.acsu.buffalo.edu 1048686381 6563 128.205.34.3 (26 Mar 2003 13:46:21 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 26 Mar 2003 13:46:21 +0000 (UTC) X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.563:83 "William J. Rapaport" wrote: > > ------------------------------------------------------------------------- > Subject: HW 6 MODIFICATION > ------------------------------------------------------------------------- > > While doing HW 6 last night, I also decided that problem 10, while not > intrinsically more difficult than any of problems 1-9 (and I warn you, > problem 1 is LONG!), is considerably longer than any of them (including > #9!). Actually, what I meant to say was that 10 is considerably longer than **1**, so don't worry if #1 seems overly long :-) From - Thu Mar 27 14:14:03 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW 6 GRADING SCHEME Date: Wed, 26 Mar 2003 09:48:20 -0500 (EST) Organization: Computer Science and Engineering Lines: 59 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048690100 13450 128.205.34.3 (26 Mar 2003 14:48:20 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 26 Mar 2003 14:48:20 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:84 ------------------------------------------------------------------------- Subject: HW 6 GRADING SCHEME ------------------------------------------------------------------------- Problems 1-9: ------------------------------------------------------------------------- 9 sentences, 3 points each, total = 27 points 0 = not done 1 = incorrect, not enough work shown for us to figure out what went wrong 2 = incorrect, but shows enough intermediate steps for us to figure out what went wrong 3 = correct clause form (or correct CNF) Grand total = 27 points Letter 463 both 563 ------ --- ---- --- A 26-27 A- 24-25 B+ 22-23 B 20-21 B- 18-19 C+ 16-17 C 14-15 10-15 C- 12-13 D+ 10-11 D 6-9 F 0-5 ------------------------------------------------------------------------- Extra Credit problem: no credit if not done A = done completely correctly with all steps justified by our algorithm's numbering scheme B = incorrect, but only 1 or 2 small errors (either early on & that propagated through the rest of a substantially correct answer or else very late in the game, so that most of the conversion to clause form is correct except for a small mistake or two right at the end, where the student's concentration is likely to be foggy after all those parentheses :-) C = incorrect, with many errors, showing little or no understanding of the conversion algorithm. +/- grades can be added at the grader's discretion. This letter grade can replace the student's lowest HW grade (thus the *next* lowest HW grade becomes the one that's dropped) From - Thu Mar 27 14:14:32 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Homework 5 Syntax and Semantics Date: Wed, 26 Mar 2003 14:20:43 -0500 Organization: The University at Buffalo Lines: 63 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1048706444 13698 128.205.35.2 (26 Mar 2003 19:20:44 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 26 Mar 2003 19:20:44 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:85 Here are the syntax and semantics used on the sample solutions to homework 5. The syntax and semantics for question 2f are not given below; a clarification of this problem will be posted separately. In the 11am recitation, it was pointed out that "One more outburst like that" is not a proposition. The problem here is related to the one we discussed with respect to problem 2b: there are parts of the sentence that are implied. Specifically, the proposition for the first half of the sentence is properly (formally) given as "You make one more outburst like that". ---- Part 1: Predicates: [[Student(x)]] = [[x]] is a Student [[Takes(x,y)]] = [[x]] takes [[y]] [[Fails(x,y)]] = [[x]] fails [[y]] [[Score(x,y)]] = [[x]] is the best score in [[y]] [[GreaterThan(x,y)]] = [[x]] is better than [[y]] [[Person(x)]] = [[x]] is a person [[Dislikes(x,y)]] = [[x]] dislikes [[y]] [[Smart(x)]] = [[x]] is smart [[CS(x)]] = [[x]] is a computer scientist [[Woman(x)]] = [[x]] is a woman [[Likes(x,y)]] = [[x]] likes [[y]] [[Barber(x)]] = [[x]] is a barber [[Man(x)]] = [[x]] is a man [[Shaves(x,y)]] = [[x]] shaves [[y]] [[Professor(x)]] = [[x]] is a professor [[Politician(x)]] = [[x]] is a politician [[Time(x)]] = [[x]] is a time [[Fools(x,y,z)]] = [[x]] fools [[y]] at time [[z]] Functions: [[CompSci]] = computer science [[Philosophy]] = philosophy Part 2 (using propositional logic): Propositions: [[Outburst]] = You make one more outburst like that [[Contempt]] = You'll be in contempt of court [[GoodMovieOn]] = There is a good movie on tonight [[Interested]] = You are interested [[CanWatch]] = You can watch [[Special(x)]] = The special this morning is [[x]] [[Do(x)]] = I do action [[x]] [[Jump]] = I jump off of the Empire State Building [[Cause(x,y)]] = The cause of [[y]] is [[x]] [[Float]] = I float gently to the ground [[Attempt]] = You attempt this exercise [[F]] = You get an F Functions: [[Ham]] = Ham [[Eggs]] = Eggs [[Combination(x,y)]] = the combination of [[x]] and [[y]] From - Thu Mar 27 14:14:56 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Commentary on Homework 5, part 2f Date: Wed, 26 Mar 2003 23:27:12 -0500 Organization: The University at Buffalo Lines: 61 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1048739234 836 128.205.35.2 (27 Mar 2003 04:27:14 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 27 Mar 2003 04:27:14 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:86 The instructor's manual with the solutions for Homework 5, question 2f, gives the following straightforward interpretation: ((Here > Home) ^ (Home > ~Here)) YIELDS (Here > ~Here) This is also given on the homework 5 solutions handout, distributed in recitation on Mar 26th. The authors of the instructor's manual do not bother specifying the syntax and semantics; they fall prey to the "Pretend-It's-English" bug. If we try to specify the syntax and semantics for their solution, we end up needing to say that "Here" means both "You live here" and "You are here." These two are clearly different, and I should mark the solution manual as incorrect. :) A better way to represent the paragraph is to realize that "living" and "being somewhere" are very different, giving a formulation like this: [[LiveHere]] = You live here [[AreHere]] = You are here [[WouldBeHere]] = You would be here [[Home]] = You are home [[WouldBeHome]] = You would be home (I am assuming that all of this is happening "now".) Straightforward translation: ((LiveHere > WouldBeHome) ^ (Home > ~WouldBeHere)) YIELDS (LiveHere > ~WouldBeHere) We may alternately wish to consider "would be" to mean the same as "be", which would give this formulation: ((LiveHere > Home) ^ (Home > AreHere)) YIELDS (LiveHere > ~AreHere) The key point is that we certainly cannot use one symbol to represent the separate concepts of "being here" and "living here", despite the fact that they both contain the word "here". Either of the above are good straightforward translations that do not consider the intention of the sentence separately from its syntactic structure. The professor's remarks on this problem are given below: 1. "here" is an indexical; i.e., although in one sense it means the same thing no matter where it is used, namely, something like "at the speaker's location", in another sense it means different things depending on where the speaker is. In "I am here" said by me in Bell 214, "here" refers to Bell 214, but in "I am here" said by me in Baldy 209, "here" refers to Baldy 209. 2. "would be" is in the subjunctive, and requires an extension to FOL, called "modal logic", to fully analyze. In modal logic, we can talk about different "possible worlds", e.g., the world we actually live in vs. a world just like ours but in which, say, you live somewhere else. I hope to be able to say a few words about modal logic towards the end of the course. From - Thu Mar 27 14:15:07 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SYLLABUS UPDATED Date: Thu, 27 Mar 2003 09:45:49 -0500 (EST) Organization: Computer Science and Engineering Lines: 14 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048776349 26035 128.205.34.3 (27 Mar 2003 14:45:49 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 27 Mar 2003 14:45:49 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:87 ------------------------------------------------------------------------- Subject: SYLLABUS UPDATED ------------------------------------------------------------------------- I have once again updated the syllabus to more accurately reflect what we've done and what I plan (= hope) to do. In particular, I have eliminated the requirement to (re-)read B&L Chs. 5-6 (just study Chs. 2 & 4 carefully). You can go directly to the new syllabus at: http://www.cse.buffalo.edu/~rapaport/563/syl.html#dates From - Fri Mar 28 12:54:44 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: RESOLUTION PROOF IN NATURAL-DEDUCTION FORMAT Date: Fri, 28 Mar 2003 11:21:14 -0500 (EST) Organization: Computer Science and Engineering Lines: 23 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1048868474 19794 128.205.34.3 (28 Mar 2003 16:21:14 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 28 Mar 2003 16:21:14 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:88 ------------------------------------------------------------------------- Subject: RESOLUTION PROOF IN NATURAL-DEDUCTION FORMAT ------------------------------------------------------------------------- The propositional-logic resolution proof that we did in lecture today is on the web in *natural-deduction* format at: http://www.cse.buffalo.edu/~rapaport/563/resolution.pf.html Note that some older browsers might show lower-case Greek alpha as α It occurs in only one place: in a statement of Resolution as a natural-deduction rule of inference. So, here it is without "alpha"s: From a subproof -A |- [ ] ------------------------- Infer A in that subproof I.e., if, in a subproof, you can infer the empty clause, [ ], from the negation of wff A, then you can infer A in that subproof. From - Wed Apr 2 09:09:39 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROJECT 2 GRADING SCHEME Date: Tue, 1 Apr 2003 14:46:21 -0500 (EST) Organization: Computer Science and Engineering Lines: 90 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049226381 1978 128.205.34.3 (1 Apr 2003 19:46:21 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 1 Apr 2003 19:46:21 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:89 Here is the ... ========================================================================= Project 2: Tentative Grading Scheme ========================================================================= which can also serve as a guide to what to include in your report!!!!!!!! There are essentially 2 parts to this project: * description of reasoning in propositional logic * implementation of Proof Giver Each will be worth 50%, broken down as follows: Description of reasoning in propositional logic: ------------------------------------------------------------------------- This should include (10% each): - description of propositional logic, the syntactic derivation relation |-, the semantic derivation relation |= 0,3,7,10 - distinction between: * syntactic proof theory (proving that D|-a holds for a set of premises "D" and a wff "a"), and ... * semantic truth-table method of proof (proving that D|=a holds for premise-set "D" and wff "a") 0,3,7,10 - description of our natural-deduction system (at least for -, >) 0,3,7,10 - the 2 proofs 0,1,3,5 0,1,3,5 - description of Proof Giver & your implementation of it: * its purpose & basic structure * what it can do * what it can't do (yet) 0,3,7,10 Implementation of Proof Giver ------------------------------------------------------------------------- * annotated demos (25%): - demos of running code (the 2 proofs) 0,1,3,5 (10%) 0,1,3,5 - annotations of the demo, explaining what's going on and why (15%) 0,5,10,15 * commented code (25%): - code (both printed as an appendix to your report *and* "submit"ted online, so we can test it) (10%) 0,3,7,10 - comments to allow us to understand your implementation, its capabilities, and its limitations (15%) 0,5,10,15 TOTAL = 100 points Letter 463 both 563 ------ --- ---- --- A 95-100 A- 90-94 B+ 84-89 B 79-83 B- 73-78 C+ 68-72 C 57-67 34-67 C- 45-56 D+ 34-44 D 18-33 F 0-17 From - Fri Apr 4 08:30:12 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROJECT 2 SUGGESTION Date: Thu, 3 Apr 2003 09:10:35 -0500 (EST) Organization: Computer Science and Engineering Lines: 13 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049379035 24302 128.205.34.3 (3 Apr 2003 14:10:35 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 3 Apr 2003 14:10:35 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:90 ------------------------------------------------------------------------- Subject: PROJECT 2 SUGGESTION ------------------------------------------------------------------------- Several students have come to me with questions about the Proof Giver algorithm's ability to handle all possible inferences in propositional logic. If you feel that Proof Giver falls short in some respect, or if there is some aspect of Proof Giver that you are unable to implement, then please give an analysis or explanation of the "missing" features as part of your report. From - Sat Apr 5 08:51:25 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: P.N. JOHNSON-LAIRD: MENTAL MODELS FOR REASONING Date: Fri, 4 Apr 2003 08:44:47 -0500 (EST) Organization: Computer Science and Engineering Lines: 96 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049463887 27185 128.205.34.3 (4 Apr 2003 13:44:47 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 4 Apr 2003 13:44:47 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:91 sunyab.cse.740:37 This year's Cog Sci Center distinguished speaker is Philip N. Johnson-Laird, who has done work relevant to knowledge representation and reasoning (briefly, and vastly oversimplified, his claim is that we don't reason syntactically (using "laws of thought", i.e., rules of inference), but semantically (using "mental" models, i.e., mental semantic interpretations). I will discuss his theories in class, and you should take a look at the websites listed in our syllabus. Here is the announcement of his public lecture (there will be another, more technical, talk on Wed. Apr. 16, 2-4 p.m., Park 280): ========================================================================= CENTER FOR COGNITIVE SCIENCE University at Buffalo Presents Distinguished Speaker Series Philip Johnson-Laird, Ph.D. Department of Psychology Princeton University Tuesday, April 15, 2003 2:30 pm - 3:45 pm Slee Concert Hall, North Campus "HOW WE REASON" A long-standing tradition postulates that human thinking is rational because it is founded on the "laws of thought". This talk argues to the contrary that reasoning is not based on such laws, but on the ability to envisage possibilities. A conclusion is judged to be valid if it holds in all such MENTAL MODELS of the given information, and probable if it holds in most of them. This theory is based on three main principles: each mental model represents a possibility; the structure of models corresponds to the structure of what they represent; and models normally represent only what is true. The talk outlines the evidence corroborating the theory from behavioral and brain-imaging studies. Inferences from one model are easier than inferences from multiple models. Knowledge affects the process of reasoning. And, if falsity matters, reasoners commit systematic fallacies. Humans are not always rational, but they are not intrinsically irrational, either. About the Presenter: Johnson-Laird was born in Yorkshire, England. He left school at the age of 15 and spent ten years in a variety of occupations until he went to University College, London to read psychology. He later gained his Ph.D. there under the supervision of Peter Wason, and he joined th faculty in 1966. In 1971, he was a visiting member of the Institute of Advanced Study, Princeton, where he began a collaboration with George A. Miller. Subsequently, he held positions at the University of Sussex (1973-1981) and at the Medical Research Council's Applied Psychology Unit (1981-1989) in Cambridge, where he was also a Fellow of Darwin College. He returned to Princeton in 1989 to be a member of the faculty at the University, where he is the Stuart Professor of Psychology. He has published ten books, and over two hundred papers. He is married and has two children. In his spare time, if he had any, he would play modern jazz piano. Sponsored by: Department of Psychology Samuel P. Capen Chair of Anthropology Department of Computer Science and Engineering The C.S. Peirce Professorhip in American Philosophy Department of Philosophy Open to the Public Free Admission For more information please contact the Cognitive Science Office at (716) 645-3794, or email hhjones@buffalo.edu. http://wings.buffalo.edu/cogsci/People/Distinguishedspeakers/johnson.lair.philip.htm ------------------------------------------------------------------------- Heike Jones Administrative Assistant University at Buffalo Center for Cognitive Science 652 Baldy Hall Buffalo, NY 14260 P: (716) 645-3794 F: (716) 645-3825 Email: hhjones@buffalo.edu URL: http://www.cogsci.buffalo.edu From - Tue Apr 8 12:34:15 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: DOUG LENAT, "COMPUTERS VS. COMMON SENSE" Date: Mon, 7 Apr 2003 11:35:37 -0400 (EDT) Organization: Computer Science and Engineering Lines: 45 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049729737 11964 128.205.34.3 (7 Apr 2003 15:35:37 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 7 Apr 2003 15:35:37 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:92 sunyab.cse.740:40 ------------------------------------------------------------------------- Subject: DOUG LENAT, "COMPUTERS VS. COMMON SENSE" ------------------------------------------------------------------------- Distinguished Speakers Series Presents Dr. Doug Lenat President, Cycorp, Inc. Computers versus Common Sense Computers today are idiot-savants. They may manage bits flawlessly and furiously, but they have no understanding of what those bits signify. And they have poor models of themselves and of the human beings they serve and represent. To break that "brittleness bottleneck," we need a new software layer that contains the millions of things the average person knows about the world. Some of this is factual, such as how often a U.S. Presidential election is held, or even ephemeral, such as the name of the current President; but most of the needed content is more like rules of thumb, such as why one should carry a glass of water open-end up. In terms of a newspaper or book, we are talking about codifying the white space - the things the authors don't need to bother saying (e.g., the White House is in Washington, D.C.; tables have flat horizontal tops; appliances stop working during a power failure.) Since 1984, my team has spent the seven person-centuries necessary to build that artifact. In this talk, I'll describe what we did, and why, and some of the lessons we learned about representing commonsense knowledge, and doing reasoning in huge knowledge-based systems. I'll also discuss some current and future commercial applications of our technology (CYC). Friday, April 11, 2003 3:30 - 4:30 pm Student Union Room 330 University at Buffalo - North Campus This talk is free and open to the public. Refreshments after the talk in 226 Bell Hall For more information, please email cse-dept@cse.buffalo.edu From - Tue Apr 8 12:34:30 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: RAPAPORT'S OFFICE HOURS CHANGED 4/8/03 Date: Tue, 8 Apr 2003 08:14:22 -0400 (EDT) Organization: Computer Science and Engineering Lines: 10 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: castor.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049804062 25982 128.205.32.14 (8 Apr 2003 12:14:22 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 8 Apr 2003 12:14:22 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:93 ------------------------------------------------------------------------- Subject: RAPAPORT'S OFFICE HOURS CHANGED 4/8/03 ------------------------------------------------------------------------- Prof. Rapaport will NOT have office hours today (Tue, Apr 8) at the usual time (2-2:50 pm). I will *try* to be available in the *late* morning on Tuesday (i.e., before noon, but I cannot guarantee it). From - Tue Apr 8 12:34:38 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW 7 GRADING SCHEME Date: Tue, 8 Apr 2003 12:33:17 -0400 (EDT) Organization: Computer Science and Engineering Lines: 62 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049819597 17707 128.205.34.3 (8 Apr 2003 16:33:17 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 8 Apr 2003 16:33:17 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:94 ------------------------------------------------------------------------- Subject: HW 7 GRADING SCHEME ------------------------------------------------------------------------- As usual, 3 = correct 2 = partial credit 1 = incorrect 0 = not done ------------------------------------------------------------------------- 1a) 0123 b) 0123 c) 0123 d) 0123 2a) Premise 0123 Conclusion 0123 b) Premise 0123 Conclusion 0123 c) Proof 0123 MGUs 0123 3a) 01234 (i.e., 1 point per part) b) 01234 (ditto) c) Proof 0123 MGUs 0123 4a) (A) 0123 (B) 0123 b) (A) t/f? 01 why? 0123 c) (B) t/f? 01 why? 0123 d) 0123 e) 0123 ------------------------------------------------------------------------- Total = 64 points Letter 463 both 563 ------ --- ---- --- A 61-64 A- 58-60 B+ 54-57 B 51-53 B- 47-50 C+ 44-46 C 37-43 22-43 C- 29-36 D+ 22-28 D 12-21 F 0-11 From - Fri Apr 11 11:02:33 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROJECT 3: DEFINITIONS & SNePSLOG Date: Thu, 10 Apr 2003 09:42:13 -0400 (EDT) Organization: Computer Science and Engineering Lines: 66 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049982133 2481 128.205.34.3 (10 Apr 2003 13:42:13 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 10 Apr 2003 13:42:13 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:95 ------------------------------------------------------------------------- Subject: PROJECT 3: DEFINITIONS & SNePSLOG ------------------------------------------------------------------------- As some of you have found out, the definition I gave in the Project 3 instructions for "sibling" won't work in SNePSLOG. I suspect that some of the other online KRR systems will have trouble with it, too. To remind you, here's the definition: AxAy[Sibling(x,y) <-> Az[Parent(z,x) <-> Parent(z,y)]] One problem is with the nested biconditional: Many "simple" reasoning systems, including SNePSLOG and, I believe, Prolog, can't handle them, since using them in inference requires proving the biconditional, which these systems are not equipped to do. (As a reminder, for those of you who know Prolog: In Prolog, you must write all wffs as "Horn clauses": i.e., *conditionals* (not *bi*conditionals) with only *one* consequent and with a *conjunction* as antecedent.) So we need to simplify this definition. First, what is a definition? In a formal system, a definition is a set of necessary and sufficient conditions for the concept being defined. My definition of "Sibling", above, satisfies this: That's what the main biconditional indicates, namely, that a necessary condition for being siblings is to have the same parents (i.e., Sibling -> same parents), and that having the same parents is a sufficient condition for being siblings (i.e., same parents -> Sibling). (In real life, this doesn't always work out so nicely. The early 20th-century philosopher Ludwig Wittgenstein (pronounced "vit-guenn-shtine") pointed out that it is impossible to give necessary and sufficient conditions for the concept "game", as in basketball, shuffleboard, dice, chess, etc.) Since biconditionals, however, give trouble for some reasoning systems, we can write the biconditional as two conditionals: AxAy[Sibling(x,y) -> Az[Parent(z,x) <-> Parent(z,y)]] AxAy[Az[Parent(z,x) <-> Parent(z,y)] -> Sibling(x,y)] But we still have to get rid of the nested biconditional. Here, we can rely on the fact that another perfectly good sufficient condition for "Sibling" is this: If z is a parent of x, & z is a parent of y, then x and y are siblings. (This actually oversimplifies the real "sibling" relation: it doesn't take into account *half*siblings, where 2 people only share one parent, not both.) Now we can formulate the sufficient condition as follows: AxAyAz[Parent(z,x) ^ Parent(z,y) -> Sibling(x,y)] This works (try it!) Bottom line: Although I would like you to provide full definitions (necessary and sufficient conditions) for all terms in the project, if you are planning on using one of the KRR-system implementations, you may have to relax these to simpler sufficient conditions to get things to work. If, on the other hand, you are going to use FOL and do things only in the "paper & pencil" way, then the biconditionals will work. Note, however, that you don't *need* the full power of the biconditional in most cases, since, in most cases, you're asking whether (e.g.) two individuals are siblings; in that case, you only need the "sufficient" half of the biconditional definition. From - Fri Apr 11 11:02:42 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: SYLLABUS UPDATED Date: Thu, 10 Apr 2003 09:54:04 -0400 (EDT) Organization: Computer Science and Engineering Lines: 9 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049982844 3363 128.205.34.3 (10 Apr 2003 13:54:04 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 10 Apr 2003 13:54:04 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:96 ------------------------------------------------------------------------- Subject: SYLLABUS UPDATED ------------------------------------------------------------------------- The syllabus has been update to reflect some schedule changes. For the latest version, go to: http://www.cse.buffalo.edu/~rapaport/563/syl.html#dates From - Fri Apr 11 11:02:50 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: PHILIP N. JOHNSON-LAIRD Date: Thu, 10 Apr 2003 10:02:39 -0400 (EDT) Organization: Computer Science and Engineering Lines: 16 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049983359 4238 128.205.34.3 (10 Apr 2003 14:02:39 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 10 Apr 2003 14:02:39 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:97 sunyab.cse.740:43 ------------------------------------------------------------------------- Subject: PHILIP N. JOHNSON-LAIRD ------------------------------------------------------------------------- Those of you wishing to learn something about Phil Johnson-Laird's theory of mental models in preparation for his forthcoming visit as the Center for Cognitive Science's Distinguished Speaker next Tuesday and Wednesday, and who don't have the time to read one of his books on the topic, might find a website I put together for one of my courses of some use. In particular, the first two items on this site, "A Logical Illusion" and "Mental Models: A Gentle Guide for Outsiders" (the latter being a paper by J-L et al.), are especially recommended. http://www.cse.buffalo.edu/~rapaport/572/S02/mental.models.html From - Fri Apr 11 11:02:58 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: DOUG LENAT Date: Thu, 10 Apr 2003 10:13:25 -0400 (EDT) Organization: Computer Science and Engineering Lines: 14 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049984005 5060 128.205.34.3 (10 Apr 2003 14:13:25 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 10 Apr 2003 14:13:25 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:98 sunyab.cse.740:44 ------------------------------------------------------------------------- Subject: DOUG LENAT ------------------------------------------------------------------------- Those of you wishing to learn more about Doug Lenat's work on CYC, in preparation for his visit on Friday, April 11, as the Department of Computer Science & Engineering's Distinguished Speaker might be interested in the following article that is available online: Lenat, Douglas B. (1995), "CYC: A Large-Scale Investment in Knowledge Infrastructure", CACM 38 (11): 33-38. http://www.cse.buffalo.edu/~rapaport/563/lenat95.pdf From - Fri Apr 11 11:03:05 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: ONTOLOGY AND TIME Date: Thu, 10 Apr 2003 14:24:05 -0400 (EDT) Organization: Computer Science and Engineering Lines: 12 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1049999045 27086 128.205.34.3 (10 Apr 2003 18:24:05 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 10 Apr 2003 18:24:05 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:99 ------------------------------------------------------------------------- Subject: ONTOLOGY AND TIME ------------------------------------------------------------------------- For further readings on ontology in general, and on time in particular (many of them online), go to: http://www.cse.buffalo.edu/~rapaport/563/ontology.html or http://www.cse.buffalo.edu/~rapaport/563/time.tense.html From - Wed Apr 16 08:31:12 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MENTAL MODELS PUZZLE Date: Mon, 14 Apr 2003 11:51:36 -0400 (EDT) Organization: Computer Science and Engineering Lines: 14 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050335496 9813 128.205.34.3 (14 Apr 2003 15:51:36 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 14 Apr 2003 15:51:36 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:100 ------------------------------------------------------------------------- Subject: MENTAL MODELS PUZZLE ------------------------------------------------------------------------- Only one of the following is true about a particular hand of cards: (a) There's a King in the hand or there's an Ace in the hand, or both. (b) There's a Queen in the hand or there's an Ace in the hand, or both. (c) There's a Jack in the hand or there's a 10 in the hand, or both. Is it possible that there's an Ace in the hand? See the next news item for the answer. From - Wed Apr 16 08:31:31 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MENTAL MODELS ANSWER -- DON'T LOOK! Date: Mon, 14 Apr 2003 11:52:52 -0400 (EDT) Organization: Computer Science and Engineering Lines: 60 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050335572 10115 128.205.34.3 (14 Apr 2003 15:52:52 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 14 Apr 2003 15:52:52 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:101 ------------------------------------------------------------------------- Subject: MENTAL MODELS ANSWER -- DON'T LOOK! ------------------------------------------------------------------------- Only one of the following is true about a particular hand of cards: (a) There's a King in the hand or there's an Ace in the hand, or both. (b) There's a Queen in the hand or there's an Ace in the hand, or both. (c) There's a Jack in the hand or there's a 10 in the hand, or both. Is it possible that there's an Ace in the hand? Answer: (scroll down) ANSWER: No; it's not possible. Next question: Why not? (You figure it out :-) From - Wed Apr 16 08:31:40 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: NO OFFICE HOURS TUESDAY Date: Mon, 14 Apr 2003 17:36:26 -0400 (EDT) Organization: Computer Science and Engineering Lines: 7 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050356186 12183 128.205.34.3 (14 Apr 2003 21:36:26 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 14 Apr 2003 21:36:26 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:102 sunyab.cse.740:46 ------------------------------------------------------------------------- Subject: NO OFFICE HOURS TUESDAY ------------------------------------------------------------------------- Because of Johnson-Laird's visit and talk, I will not have office hours on Tuesday. From - Wed Apr 16 08:32:41 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563,sunyab.cse.740 Subject: JOHNSON-LAIRD ON CAUSAL REASONING Date: Tue, 15 Apr 2003 16:58:23 -0400 (EDT) Organization: Computer Science and Engineering Lines: 60 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050440303 11729 128.205.34.3 (15 Apr 2003 20:58:23 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 15 Apr 2003 20:58:23 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:103 sunyab.cse.740:47 ------------------------------------------------------------------------- Subject: JOHNSON-LAIRD ON CAUSAL REASONING ------------------------------------------------------------------------- CENTER FOR COGNITIVE SCIENCE University at Buffalo Wednesday, April 16, 2003 2:00 p.m. - 4:00 p.m. 280 Park Hall, North Campus Philip Johnson-Laird, Ph.D. Department of Psychology Princeton University "Naive Causality: A Theory of Causal Meaning and Reasoning" This talk outlines a theory and computer implementation of causal meanings and reasoning. The meanings depend on possibilities, and there are four weak causal relations: A causes B, A prevents B, A allows B, and A allows not-B, and two stronger relations of cause and prevention. Individuals represent these relations in mental models of what is true in the various possibilities. The theory predicts a number of phenomena, and the talk presents experiments corroborating these predictions. Contrary to many accounts, the meaning of causation is not probabilistic, causes differ in meaning and logic from enabling conditions, and causal reasoning does not depend on schemas or rules. Sponsored by: Department of Psychology Samuel P. Capen Chair of Anthropology Department of Computer Science and Engineering The C.S. Peirce Professorhip in American Philosophy Department of Philosophy Open to the Public Free Admission For more information please contact the Cognitive Science Office at (716) 645-3794, or email hhjones@buffalo.edu. http://wings.buffalo.edu/cogsci/People/Distinguishedspeakers/johnson.lair.philip.htm Heike Jones Administrative Assistant University at Buffalo Center for Cognitive Science 652 Baldy Hall Buffalo, NY 14260 P: (716) 645-3794 F: (716) 645-3825 Email: hhjones@buffalo.edu URL: http://www.cogsci.buffalo.edu From - Thu Apr 17 09:14:45 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROJECT 3: DEF OF "SIBLING" Date: Wed, 16 Apr 2003 11:31:01 -0400 (EDT) Organization: Computer Science and Engineering Lines: 22 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050507061 14723 128.205.34.3 (16 Apr 2003 15:31:01 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 16 Apr 2003 15:31:01 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:104 ------------------------------------------------------------------------- Subject: PROJECT 3: DEF OF "SIBLING" ------------------------------------------------------------------------- Some students have pointed out that my English definition of "sibling" does not match my FOL definition. That's because I changed my mind between the time I looked up the definition in the Collins COBUILD dictionary and the time I formulated the FOL version, but I forgot to fix the project handout. So: The informal English definition that corresponds to the formal FOL version is: Your sibling is someone who has the same parents as you. Note that "you" and "your" do NOT appear in the FOL version! A more accurate *English* rendering of the FOL might be: Siblings have the same parents. From - Thu Apr 17 09:15:12 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MINOR SYLLABUS UPDATE Date: Thu, 17 Apr 2003 09:13:51 -0400 (EDT) Organization: Computer Science and Engineering Lines: 11 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050585231 7709 128.205.34.3 (17 Apr 2003 13:13:51 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 17 Apr 2003 13:13:51 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:105 ------------------------------------------------------------------------- Subject: MINOR SYLLABUS UPDATE ------------------------------------------------------------------------- I have slightly updated the syllabus to reflect recent changes in the schedule of topics. For the latest changes, go to: http://www.cse.buffalo.edu/~rapaport/563/syl.html#dates From - Fri Apr 18 11:53:38 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: ANALOG and SNePS-3 Date: Thu, 17 Apr 2003 09:53:50 -0400 (EDT) Organization: Computer Science and Engineering Lines: 8 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050587630 11739 128.205.34.3 (17 Apr 2003 13:53:50 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 17 Apr 2003 13:53:50 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:106 ------------------------------------------------------------------------- Subject: ANALOG and SNePS-3 ------------------------------------------------------------------------- I've created a web page for ANALOG and SNePS-3, which we discussed in lecture on Wednesday: http://www.cse.buffalo.edu/~rapaport/563/sneps3.html From - Fri Apr 18 11:53:51 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: KNOWLEDGE SHARING Date: Thu, 17 Apr 2003 10:17:28 -0400 (EDT) Organization: Computer Science and Engineering Lines: 21 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050589048 13787 128.205.34.3 (17 Apr 2003 14:17:28 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 17 Apr 2003 14:17:28 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:107 ------------------------------------------------------------------------- Subject: KNOWLEDGE SHARING ------------------------------------------------------------------------- Another topic we discussed on Wednesday was "knowledge sharing": how to get two KRR systems, possibly with different ontologies, to "talk" to each other. Here's a paper on the DARPA (Dept. of Defense Advanced Research Projects Agency) project: Patil, Ramesh S.; Fikes, Richard E.; Patel-Schneider, Peter F.; McKay, Don [who, by the way, is a former student of Shapiro]; Finin, Tim; Gruber, Thomas; & Neches, Robert (1993), "The DARPA Knowledge Sharing Effort: Progress Report" in _KR'92. Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference_ For more information, and links to downloadable versions in various formats, see the "citeseer" webpage for this article: http://citeseer.nj.nec.com/patil93darpa.html From - Tue Apr 22 09:02:01 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW 9 UPDATE Date: Mon, 21 Apr 2003 11:17:28 -0400 (EDT) Organization: Computer Science and Engineering Lines: 58 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050938248 12779 128.205.34.3 (21 Apr 2003 15:17:28 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 21 Apr 2003 15:17:28 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:108 ------------------------------------------------------------------------- Subject: HW 9 UPDATE ------------------------------------------------------------------------- It occurred to me as I was explaining HW 9 that there's an easier way to represent frames in SNePS. Instead of using the "standard" SNePS case frames, you should try to represent frames *directly* in SNePS. However, for this, you *will* have to provide a syntax and semantics for your new case frames. To go along with Hayes's general formalism for representing frames in FOL, here is a general formalism for representing frames in SNePS: Represent this frame: frame F slot-1 filler-1 ... slot-n filler-n as a SNePS network as follows: First, define new relations, one for "frame" and one each for the slots: (define frame ... ) where is the actual name of the slot (not the 6-character string "slot-i") Then assert the following for each frame: (assert frame F slot-1 filler-1 ... slot-n filler-n) For example: frame human isa living_thing parts (head body arms legs) actions (walk run jump think) might become, in SNePS: (define frame isa parts actions) (assert frame human isa living_thing parts head parts body parts arms parts legs actions walk actions run actions jump actions think) From - Tue Apr 22 09:02:19 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: ONTOLOGY AND DATA ACCESS Date: Mon, 21 Apr 2003 12:50:36 -0400 (EDT) Organization: Computer Science and Engineering Lines: 12 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050943836 21982 128.205.34.3 (21 Apr 2003 16:50:36 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 21 Apr 2003 16:50:36 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:109 ------------------------------------------------------------------------- Subject: ONTOLOGY AND DATA ACCESS ------------------------------------------------------------------------- I just came across a recent article in CACM that some of you might find interesting: Hovy, Eduard (2003), "Using an Ontology to Simplify Data Access", Communications of the ACM 46(1): 47-49. It's on the Web at: http://doi.acm.org/10.1145/602421.602447 From - Tue Apr 22 09:02:51 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: COMMENTING CODE Date: Mon, 21 Apr 2003 12:54:40 -0400 (EDT) Organization: Computer Science and Engineering Lines: 14 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050944080 22291 128.205.34.3 (21 Apr 2003 16:54:40 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 21 Apr 2003 16:54:40 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:110 ------------------------------------------------------------------------- Subject: COMMENTING CODE ------------------------------------------------------------------------- A number of you have requested suggestions on how to comment code. I recently found a document on coding standards, courtesy of Mike Buckley, from a major corporation; it is the mandatory standard for the 6,000 people that they employ to write code. I will make it available at: http://www.cse.buffalo.edu/~rapaport/coding.standards.pdf From - Tue Apr 22 09:03:54 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: QUESTIONS ABOUT FRAMES Date: Mon, 21 Apr 2003 13:42:04 -0400 (EDT) Organization: Computer Science and Engineering Lines: 64 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050946924 26383 128.205.34.3 (21 Apr 2003 17:42:04 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 21 Apr 2003 17:42:04 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:111 ------------------------------------------------------------------------- Subject: QUESTIONS ABOUT FRAMES ------------------------------------------------------------------------- A student writes: > I had a few questions about frames: > > (1) By what mechanism can new event frames be constructed for > NON-stereotypical events? A more general question is how any frame system > introduces new frames (because it can't be equivalent to FOL unless there > are some inference rules...right?) First, frames are not a formally-defined KRR system, but a general method for representing information. There are several implemented frame systems, each of which will handle these matters in different ways. For one example, see the article by Fikes cited on the "Frames" webpage for the course. You can easily have a frame for a non-stereotypical entity, e.g. (using the notation introduced in class): frame CSE_563_4/21/03 isa lecture topic description_logics (etc.) New frames would have to be introduced the same way any new information would be introduced into any KRR system: using TELL (or via inference from already existing frames). > I was thinking of a few examples of non-stereotypical events for which we > COULD construct frames: > > (i) a frame for a "gulf war" could be constructed now which includes slot > fillers like initial heavy bombing, oil fields set ablaze, high propaganda > etc... > > (ii)Also, in the past decade several "woodstock" concerts have been > held...which used the original woodstock concert in '69 as a frame. It > seems to me that the organizers had to extract key features from the > original non-stereotypical concert (i.e. slots) if they wanted to call it > a "woodstock" concert. Moreover, I would claim that most people would > agree on what slots would need to be extracted! But note that both of these *are* stereotypical: You speak of "a" Gulf War frame, "a" Woodstock frame! > > It seems to me that the creation of new frames would be of great > importance to someone working on CYC. Yes, and I think that's what lots of their employees do: They "TELL" CYC about new commonsense things. > > (2)How are TELL_KB and ASK_KB implemented in a frame system? You can't > really use node based or path based inference... can you? You could certainly use path-based inference, i.e., inheritance: That's one of the major features of frame systems (the "hotel_room" frame inherits all of the "room" frame's slots and fillers (except those it replaces with more specific information). Implementation, however, would depend on the details of actual implemented frame systems. Again, see the Fikes article for an example. From - Tue Apr 22 09:04:06 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: RESOLUTION AND QUESTION ANSWERING Date: Mon, 21 Apr 2003 13:44:01 -0400 (EDT) Organization: Computer Science and Engineering Lines: 96 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1050947041 26400 128.205.34.3 (21 Apr 2003 17:44:01 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 21 Apr 2003 17:44:01 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:112 ------------------------------------------------------------------------- Subject: RESOLUTION AND QUESTION ANSWERING ------------------------------------------------------------------------- The following recent Call for Papers may give you an idea of some recent research interests relating to resolution: ========================================================================= Date: Fri, 18 Apr 2003 15:12:18 EDT From: Priscilla Rasmussen Subject: 2003 International Symposium on Reference Resolution and Its Applications to QA and Summarization CFP *************************************** C A L L F O R P A P E R S 2003 International Symposium on Reference Resolution and Its Applications to Question Answering and Summarization Venice, Italy June 23-25, 2003 *********************************************** Reference resolution algorithms are applicable for the processing of discourse and dialogue and more recently became important tools for textual Questions Answering (QA) systems or Summarization systems. The objective of this Symposium is to bring together researchers whose work focuses on the resolution of reference in natural language and to create a forum for the presentation and discussion of their current results. We are especially interested in the application of reference resolution to Questions Answering and Summarization and welcome papers and discussions that tackle the interactions of reference resolution with these two NLP applications. This call for papers invites submissions of papers describing recent novel and challenging work/results in reference resolution, questions answering and summarization. The range of topics to be covered will include, but will not be limited to: o new reference resolution algorithms, o reference resolution and its contribution to discourse processing, o new methods for single and multi-document summarization, o recent findings in the theory and practice of textual question answering, o theories and formalisms for reference resolution, o empirical methods in reference resolution, o applications of reference resolution, o multilingual and multidocument reference resolution, o evaluation of reference resolution o resources used for reference resolution. o reference resolution for factual questions answering o reference resolution for summarization o reference resolution for dialog processing o reference resolution for the identification of disourse relations and discourse structure Important Dates Submission Deadline: April 25 2003 <<<<<<<<<<<<<< Extended deadline Authors Notification: May 10 2003 Camera-ready deadline: June 10 2003 Conference: June 23-25 2003 Symposium Organizers: Sanda Harabagiu Rodolfo Delmonte Program Committee: Regina Barzilay, MIT/Cornell University Donna Byron, Ohio State University Nicoletta Calzolari, University of Pisa Claire Cardie, Cornell University Dan Cristea, University of Iasi Rodolfo Delmonte, Ca' Foscari University Carol Van Ess-Dykema, DoD Antonio Ferrandez, University of Alicante Udo Hahn, University of Freiburg Sanda Harabagiu, University of Texas, Dallas Graeme Hirst, University of Toronto Jerry Hobbs, USC/ISI Nancy Ide, Vassar College Steve Maiorano, University of Sheffield Ruslan Mitkov, University of Wolverhampton Massimo Poesio, University of Essex Bonnie Webber, University of Edinburgh For more information please visit: http://www.cs.utdallas.edu/~sanda/Venice/venice-symp.html From - Tue Apr 22 13:48:13 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: GRADING SCHEME & FURTHER HINTS ON HW 9 Date: Tue, 22 Apr 2003 09:39:18 -0400 (EDT) Organization: Computer Science and Engineering Lines: 38 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051018758 12167 128.205.34.3 (22 Apr 2003 13:39:18 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Tue, 22 Apr 2003 13:39:18 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:113 ------------------------------------------------------------------------- Subject: GRADING SCHEME & FURTHER HINTS ON HW 9 ------------------------------------------------------------------------- 1. Note that Hayes 1975 has a worked-out example of a translation of a frame system into FOL. 2. There are several possible ways of translating the frame system into SNePS and into FOL. Choose one for each. Grading: SNePS: 7 frames @ 3 points/frame = 21 points FOL: 7 frames @ 3 points/frame = 21 points 3 = syntactically correct SNePS or FOL that correctly "captures" all the info in the frame 2 = syntactically correct, but fails to capture some frame feature 1 = syntactically incorrect 0 = not done Total = 42 points Letter 463 both 563 ------ --- ---- --- A 41-42 A- 38-40 B+ 36-37 B 34-35 B- 31-33 C+ 29-30 C 24-28 14-28 C- 20-23 D+ 14-19 D 7-14 F 0-7 From - Thu Apr 24 09:21:22 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: TENTATIVE PROJECT 3 GRADING SCHEME Date: Wed, 23 Apr 2003 09:33:03 -0400 (EDT) Organization: Computer Science and Engineering Lines: 141 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051104783 14811 128.205.34.3 (23 Apr 2003 13:33:03 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 23 Apr 2003 13:33:03 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:114 ------------------------------------------------------------------------- Subject: TENTATIVE PROJECT 3 GRADING SCHEME ------------------------------------------------------------------------- (Note: "T=" means: total points=) ------------------------------------------------------------------------- 0. Report (+ annotated demos + commented code, if appropriate): 0, 23, 46, 69 pts Notes: * The report can be thought of as a section of B&L that is an example of how a knowledge base works: use of a KRR system to represent information (i.e., axioms), be told new input data (e.g., the British royal family tree), and inferentially answer queries made to the system. * If a student does a paper+pencil FOL version, then there's no demo or code, so the full points would just be for the report. * If a student uses SNePS or the R&N implementation of the tell/ask interface, then there should be annotated demos, but commented code is not required; # in this case, the points should be split evenly between report and demos * If a student uses an implementation of an FOL theorem prover (e.g., Shapiro's resolution algorithm), then there must be both an annotated demo *and* commented code (i.e., the code must be commented by the student *in addition to* any comments in the code placed there by the original coder). # in this case, the points should be split evenly among the report, demos, annotations of the demos, code, and comments on the code. * In all cases where computer implementations are used, the code must be properly cited (who wrote it, if known; where it is located, etc.) ------------------------------------------------------------------------- 1. Definitions of: grandchild 0,1,2,3 great-grandparent 0,1,2,3 brother 0,1,2,3 sister 0,1,2,3 daughter 0,1,2,3 son 0,1,2,3 aunt 0,1,2,3 uncle 0,1,2,3 brother-in-law 0,1,2,3 sister-in-law 0,1,2,3 first cousin 0,1,2,3 where: 3 = correct syntax and semantics *and* correct def 2 = correct syntax/semantics but incorrect def 1 = incorrect answer 0 = not done total = 33 points ------------------------------------------------------------------------- 2. Representation of the information in the British royal family tree: * Marriages (I'm using abbreviations here; see the figure on the project handout; if you need clarification of (i.e. a semantics for :-) my abbreviations, please ask): G=M 0,1,2,3 S=K 0,1,2,3 E=P 0,1,2,3 D=C 0,1,2,3 A=M 0,1,2,3 A=S 0,1,2,3 T=18 pts * Children E,M children of G,M 0123 each/T=12 (Note: 4 things to represent!) D child of S,K 0123 each/T=6 (Note: 2 things to represent!) C,A,A,E children of E,P 0123 each/T=24 (Note: 8 things to represent!) W,H children of D,C 0123 each/T=12 P,Z children of A,M 0123 each/T=12 B,E children of A,S 0123 each/T=12 T=78 pts where 0,1,2,3 interpreted as above Total = 96 points ------------------------------------------------------------------------- 3. Answer to the 3 queries: 0,1,2,3 each; T=9 ------------------------------------------------------------------------- Grand Total = 207 points Letter 463 both 563 ------ --- ---- --- A 197-207 A- 185-196 B+ 174-184 B 162-173 B- 151-161 C+ 139-150 C 116-138 70-138 C- 93-115 D+ 70-92 D 36-69 F 0-35 ========================================================================= Extra Credit Problem: ------------------------------------------------------------------------- Definition of mth cousin, n times removed: A = essentially correct B = partial credit C = incorrect Rules: Replaces lowest *HW* or *quiz* grade. If Extra-Credit grade is lower than lowest HW/quiz grade, then the HW/quiz average will be raised 1/3 letter grade (e.g., a B+ HW/quiz average with a C on the extra-credit problem will turn the B+ into an A-). Only a *complete* extra-credit problem is eligible for this treatment. From - Thu Apr 24 09:21:36 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MS THESIS DEFENSE ON DEFAULT REASONING Date: Wed, 23 Apr 2003 09:41:59 -0400 (EDT) Organization: Computer Science and Engineering Lines: 58 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051105319 15580 128.205.34.3 (23 Apr 2003 13:41:59 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 23 Apr 2003 13:41:59 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:115 ------------------------------------------------------------------------- Subject: MS THESIS DEFENSE ON DEFAULT REASONING ------------------------------------------------------------------------- In lecture today (Wed, Apr 23), we'll talk about default reasoning. Some of you might find next week's defense of a thesis on default reasoning in SNePS to be of interest: ------------------------------------------------------------------------- M.S. Thesis Defense Preferential Ordering of Beliefs for Default Reasoning Bharat Bhushan April 28, 2003 12:00 noon - 2 p.m. 224 Bell Hall Abstract This thesis investigates the application of ordering of beliefs to default reasoning. An important component of intelligence is decision making with the help of given information. If the given information is not sufficient, default results should be assumed. If the derivation of a proposition results in a contradiction, belief revision should occur about some proposition that led to the contradiction. A step before belief revision, however, is to see if one of the contradictory results is more preferred that the others. In the case where one result is more preferred, it may be believed by default and no beliefs may be revised. The concept of preferential ordering of beliefs for default reasoning has been used in other representation of defaults. This thesis claims that no special representations are necessary. This thesis provides a theory of the preferences of beliefs and an implementation of the theory to carry out default reasoning. The current version of the thesis is available at http://www.cse.buffalo.edu/~bbhushan/thesis/doc/chapters/thes.ps Thesis Committee Stuart C. Shapiro, Chair William J. Rapaport -- Stuart C. Shapiro, Professor Department of Computer Science and Engineering University at Buffalo, The State University of New York 201 Bell Hall Box 602000 PHONE: 716-645-3180x125 Buffalo, NY 14260-2000 FAX: 716-645-3464 U.S.A. EMAIL: shapiro@cse.buffalo.edu URL: http://www.cse.buffalo.edu/~shapiro/ From - Thu Apr 24 09:21:51 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PEGASUS DEMO Date: Wed, 23 Apr 2003 11:31:02 -0400 (EDT) Organization: Computer Science and Engineering Lines: 49 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051111862 25117 128.205.34.3 (23 Apr 2003 15:31:02 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 23 Apr 2003 15:31:02 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:116 ------------------------------------------------------------------------- Subject: PEGASUS DEMO ------------------------------------------------------------------------- I was disappointed that the SSH program that connected me to castor.cse.buffalo.edu didn't let me show you the full demo, so I've got a "canned" version on the default reasoning page, or you can run it yourself as follows: 1) You can run the demo interactively: a) run the demo b) at end, *YOU* cut & paste the last query & hit return c) *YOU* interact with the manual SNeBR interface to remove the inconsistency OR... 2) you run the preset demo that Fran Johnson made to get you through the interface, then scroll back up to show what it did. Instructions for both options (1 and 2) are given below. ---------------------------- INSTRUCTIONS FOR 1) load sneps at lisp prompt: (snepslog) at snepslog prompt: demo choose demo #4: 4 ... when demo fully ends: flies(pegasus)? snebr activated! best answers are: r 2 d q n n should result in "FLIES(PEGASUS)" lastly... at snepslog prompt: list-asserted-wffs to return to lisp... at snepslog prompt: lisp ------------------------------ INSTRUCTIONS FOR 2) load sneps at lisp prompt: (snepslog) at snepslog prompt: demo "/projects/flj/pegasus-full.snlog" av when done, scroll up to see the SNeBR interaction From - Thu Apr 24 09:22:03 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: PROJECT 3 CLARIFICATION Date: Thu, 24 Apr 2003 09:01:05 -0400 (EDT) Organization: Computer Science and Engineering Lines: 24 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051189265 780 128.205.34.3 (24 Apr 2003 13:01:05 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 24 Apr 2003 13:01:05 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:117 ------------------------------------------------------------------------- Subject: PROJECT 3 CLARIFICATION ------------------------------------------------------------------------- Those of you who are doing Project 3, whether by computer or by paper & pencil, will probably find it easier to use "partial" definitions when answering queries by resolution. A formal definition is always a biconditional. In general, to define the predicate P in terms of predicates Q and R (for instance), you should say something like this: Ax[Px <-> (Qx ^ Rx)] But when querying whether something satisfies P, you only need half of this (the "sufficient condition" half, sometimes called a "meaning postulate"): Ax[(Qx ^ Rx) -> Px] This should make your conversions to clause form much easier. From - Fri Apr 25 09:47:36 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: UNIFICATION Date: Thu, 24 Apr 2003 11:38:42 -0400 (EDT) Organization: Computer Science and Engineering Lines: 8 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051198722 13938 128.205.34.3 (24 Apr 2003 15:38:42 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 24 Apr 2003 15:38:42 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:118 ------------------------------------------------------------------------- Subject: UNIFICATION ------------------------------------------------------------------------- I've posted some "Further Thoughts on Unification" at: http://www.cse.buffalo.edu/~rapaport/563/fol.html From - Fri Apr 25 09:47:49 2003 Path: acsu.buffalo.edu!pollux.cse.buffalo.edu!pvg From: Paul V Gestwicki Newsgroups: sunyab.cse.563 Subject: Office Hours Update Date: Thu, 24 Apr 2003 13:09:04 -0400 Organization: The University at Buffalo Lines: 8 Sender: pvg@buffalo.edu Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: prometheus.acsu.buffalo.edu 1051204158 21401 128.205.35.2 (24 Apr 2003 17:09:18 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 24 Apr 2003 17:09:18 +0000 (UTC) Xref: acsu.buffalo.edu sunyab.cse.563:119 My office hours tomorrow (Apr 25) will be from 11-12 rather than 12-1. This will be my last regular office hour. If you would like to meet with me or pick up uncollected papers, contact me via email and we can set up a time and date. -Paul From - Fri Apr 25 09:48:03 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW 9 CLARIFICATION Date: Thu, 24 Apr 2003 14:40:28 -0400 (EDT) Organization: Computer Science and Engineering Lines: 92 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051209628 29055 128.205.34.3 (24 Apr 2003 18:40:28 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 24 Apr 2003 18:40:28 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:120 ------------------------------------------------------------------------- Subject: HW 9 CLARIFICATION ------------------------------------------------------------------------- A student writes: > I'm a little confused about converting frames to FOL. I understand the > basic conversion he gives: > > Ax[C(x) <-> Ey1,...Eyn[R1(x, y1) ^ ... ^ Rn(x,yn)]] > > but beyond that there isn't a good example of taking a frame and > converting it to this format. See below for a worked-out example. > > One thing that confuses me is what is y1? Don't we want to say that it is > a room in the case of the frame hotel_room and R1 being isa and y1 being > room. My best guess would be to add something to the R1(x,y1) and say > that room(y1) so that refers to another frame. Use Skolem functions; see below. > > The other issue that I can't really understand is how to represent > procedures? They can't be constants, variables or functions or > predicates, nothing really makes sense. Right! Procedures are really imperative sentences, and you need a new notation for them. Fortunately for us computer scientists, we have such a notation: programming languages! See below. > As for the frame chair with 4 > legs, my best guess is to set 4 to a constant and never use the > existential quantifier. Exactly right. > > Could you please address these issues? Sure: 1. Hayes suggests Skolemizing the FOL version; in general, it would look like this: Ax[C(x) <-> (R1(x, f1(x)) ^...^ Rn(x,fn(x))] In particular, you could then replace the Skolem functions with the actual information in the frame. He gives a small example on p. 290, column 1. But here's another: frame dog isa pet hasa tail says woof would become: Ax[Dog(x) <-> isa(x,pet) ^ hasa(x,tail) ^ says(x,woof)] Or you could use the functional notation together with equality as he suggests on p. 289, col. 2, at the bottom. Then we'd have something like this: Ax[Dog(x) <-> isa(x) = pet ^ hasa(x) = tail ^ says(x) = woof. 2. As for representing procedures, it would all depend on the details of an actual frame language that you might be using. You could define your own syntax and semantics for a generic procedural language, and use that. E.g., suppose you have a slot in a telephone frame for dialing a number, and that the filler for this slot would be a procedure that will actually do the dialing. You might use something like this: frame phone call_home (procedure callhome begin pick_up_handset; listen_for_dialtone; dial_phone_number; if answer then talk; hangup end.) If your frame language used Java, then the filler for this slot would be in Java notation; if it used Lisp, it would be in Lisp notation, etc. I hope this helps. From - Fri Apr 25 09:48:12 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MORE ON PROCEDURES (HW 9) Date: Thu, 24 Apr 2003 15:18:53 -0400 (EDT) Organization: Computer Science and Engineering Lines: 56 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051211933 2216 128.205.34.3 (24 Apr 2003 19:18:53 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Thu, 24 Apr 2003 19:18:53 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:121 ------------------------------------------------------------------------- Subject: MORE ON PROCEDURES (HW 9) ------------------------------------------------------------------------- A student writes: > I think the issue of procedures is very important, especially since in > SNePS as well it is not intuitively obvious how to do it. It is > certainly not a proposition, unless of course, you assert that the > procedure isa procedure and leave it at that. There once was a major topic in KRR around the issue of "procedural attachment": i.e., how to attach procedures to parts of a KR language. (A related term from the early history of AI is "demon" (sometimes spelled "daemon"). I believe that B&L discuss this, though I don't have my copy with me right now as I type this. You might also find the following PDF lecture notes by Jaime Carbonell of some interest: http://www.cs.cmu.edu/~awm/381/lec/frames/jgc-frames-handout.pdf or the following lecture notes on Semantic Networks and Frames: http://www.cse.unsw.edu.au/~billw/cs9414/notes/kr/frames/frames.html In SNePS, what you need is a node that isn't a proposition, but is an action that the system (or Cassie, if you prefer to think of a cognitive agent) can perform. And indeed SNePS has just that (though it took a PhD dissertation by Deepak Kumar to accomplish it)! It's called the SNePS Rational Engine (SNeRE), since it combines both reasoning (rationality) and acting (engine). For the syntax and semantics of SNeRE, look at the SNePS User Manual chapter on "SNeRE: The SNePS Rational Engine", online at: http://www.cse.buffalo.edu/~jsantore/snepsman/node47.html To see some demos (that don't always work because some of them require XGinseng, which no longer works very well), launch SNePS and try demo #8 or #9. To read about it, take a look at these online documents (others are listed in the SNeRG Bibliography): Deepak Kumar. From Beliefs and Goals to Intentions and Actions: An Amalgamated Model of Inference and Acting. PhD thesis, Technical Report 94-04, Department of Computer Science, State University of New York at Buffalo, Buffalo, NY, 1994. 203 pages http://www.cse.buffalo.edu/tech-reports/94-04.ps Deepak Kumar and Stuart C. Shapiro. Acting in service of inference (and vice versa). In Douglas D. Dankel II, editor, Proceedings of the Seventh Florida Artificial Intelligence Research Symposium, pages 207-211. the Florida AI Research Society, St. Petersburg, FL, May 1994. http://serendip.brynmawr.edu/~dkumar/flairs.ps Deepak Kumar and Stuart C. Shapiro. The OK BDI architecture. International Journal on Artificial Intelligence Tools, 3(3):349-366, March 1994 http://serendip.brynmawr.edu/~dkumar/ijait.ps From - Fri Apr 25 09:48:30 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: ONTOLOGY DEVELOPMENT Date: Fri, 25 Apr 2003 09:32:50 -0400 (EDT) Organization: Computer Science and Engineering Lines: 13 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051277570 6334 128.205.34.3 (25 Apr 2003 13:32:50 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 25 Apr 2003 13:32:50 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:122 ------------------------------------------------------------------------- Subject: ONTOLOGY DEVELOPMENT ------------------------------------------------------------------------- I just came across a potentially very useful document: Noy, Natalya F., & McGuinness, Deborah L. (2001), "Ontology Development 101: A Guide to Creating Your First Ontology" http://protege.stanford.edu/publications/ontology_development/ontology101.html There are several versions in different formats and also (apparently) some software. From - Mon Apr 28 09:41:57 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: FINAL EXAM Date: Fri, 25 Apr 2003 11:28:27 -0400 (EDT) Organization: Computer Science and Engineering Lines: 40 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051284507 18114 128.205.34.3 (25 Apr 2003 15:28:27 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Fri, 25 Apr 2003 15:28:27 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:123 ------------------------------------------------------------------------- Subject: FINAL EXAM ------------------------------------------------------------------------- I have already told you this, it is on the on-line syllabus, and I will remind you again on Monday, but just in case: Our final exam will be: ------------------------------------------------------------------------- Friday, May 2, 3:30-6:30 p.m., NSC 222 ------------------------------------------------------------------------- On Monday, I will be able to tell you in more detail what will be on the exam, but for those of you who want to begin studying now... * The exam will be like the midterm: short-answer questions similar to those on the HWs * The exam will be cumulative, covering all topics from the semester - And, as I said, if your grade on the final > your grade on the midterm exam, then it will *replace* your midterm exam grade. * One good way to study, besides reviewing your notes, is to review the HWs. Also see my "How to Study" guide for general info on how to study for exams and how to manage your time: http://www.cse.buffalo.edu/~rapaport/howtostudy.html * Specific topics that will be on the final that were *not* on the midterm include: - using the Resolution rule of inference and the Refutation strategy to infer conclusions from premises, in both propositional logic and FOL - using Unification to find a Most General Unifier for two FOL wffs, as well as applying that to enable the use of Resolution in FOL inferences - frames From - Tue Apr 29 09:20:14 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: HW 9 ANSWERS Date: Mon, 28 Apr 2003 15:49:13 -0400 (EDT) Organization: Computer Science and Engineering Lines: 8 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051559353 2776 128.205.34.3 (28 Apr 2003 19:49:13 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Mon, 28 Apr 2003 19:49:13 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:124 ------------------------------------------------------------------------- Subject: HW 9 ANSWERS ------------------------------------------------------------------------- Answers to HW 9 are on the web at: http://www.cse.buffalo.edu/~rapaport/563/hw09.answers.txt From - Thu May 1 09:17:17 2003 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.563 Subject: MORE INFO ON FINAL EXAM Date: Wed, 30 Apr 2003 10:14:51 -0400 (EDT) Organization: Computer Science and Engineering Lines: 21 Sender: Ncs@buffalo.edu Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu X-Trace: prometheus.acsu.buffalo.edu 1051712091 1217 128.205.34.3 (30 Apr 2003 14:14:51 GMT) X-Complaints-To: abuse@buffalo.edu NNTP-Posting-Date: Wed, 30 Apr 2003 14:14:51 +0000 (UTC) X-Newsreader: trn 4.0-test76 (Apr 2, 2001) Xref: acsu.buffalo.edu sunyab.cse.563:125 ------------------------------------------------------------------------- Subject: MORE INFO ON FINAL EXAM ------------------------------------------------------------------------- I can give you a bit more information on the contents of the final exam. There will be approximately one question each (though some may have several parts) on the following topics: propositional-logic semantics (truth tables) propositional-logic proof theory (natural deduction) propositional-logic resolution Mental Model puzzles (= propositional-logic reasoning) FOL representation FOL reasoning (via resolution & refutation) clause form Skolemization unification SNePS representation object-oriented semantic networks