09 February 2014

07 February 2014

Stacker toys

Stacker toys raise a number of logically interesting challenges, especially if you try to use them as logical models and in logic games. A first look is at The Smokr Tumblr (5 video posts).

06 February 2014

CFP--Logical Aspects of Computational Linguistics

LACL 2014
IRIT, Toulouse, France
18-20 June 2014
http://www.irit.fr/LACL2014/
FIRST CALL FOR CONTRIBUTIONS

LACL'2014 is the 8th international conference on logical and formal methods in computational linguistics. This conference addresses the use of type theoretic, proof theoretic and model theoretic methods for describing natural language syntax and semantics, as well as the implementation of natural language processing software relying on such models. It will be held at IRIT, Toulouse, France, from 18 to 20 June 2014.

Scope: 

Computer scientists, linguists, mathematicians and philosophers are invited to present their work on the use of logical methods in computational linguistics and natural language processing, in natural language analysis, generation or acquisition.

Topics of either theoretical or applied interest include, but are not limited to:

* logical foundation of syntactic formalisms
          o categorial grammars
          o minimalist grammars
          o dependency grammars
          o tree adjoining grammars
          o model theoretic syntax
          o formal language theory for natural language processing
          o data-driven approaches
* logics for semantics of lexical items, sentences, discourse and dialog
          o discourse theories
          o Montague semantics
          o compositionality
          o dynamic logics
          o game semantics
          o situation semantics
          o generative lexicon
          o categorical semantics
* applications of these models to natural language processing
          o software for natural language analysis
          o software for acquiring linguistic resources
          o software for natural language generation
          o software for information extraction
          o inference tasks
          o evaluation
          o scalability

 
SUBMISSIONS and PROCEEDINGS

Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) and may consist of up to 12 pages of content (including figures, bibliography, possible appendices). In exceptional cases by prior agreement with program committee a paper up to 16 pages may be considered. It is expected that each accepted paper be presented at the meeting by one of its authors.

Submission is exclusively admitted electronically, in PDF format, through the EasyChair system. The submission site is https://www.easychair.org/conferences/?conf=lacl2014
PROCEEDINGS

Accepted papers will be published as a volume of the FoLLI sub-line of Lecture Notes in Computer Science (LNCS) by Springer (http://www.springer.com/lncs).

Invited speakers:
Prof. Zhaohui Luo,  Computer Science Department, Royal Holloway, University of London, U.K.

Prof. Michael Moortgat,  Department of Language, Literature and Communication, Utrecht University, the Netherlands

Prof. Reinhard Muskens, Department of Philosophy, Tilburg University, the Netherlands
PREVIOUS EDITIONS

A selection of the 1995 articles appeared in a special issue of the Journal of Logic, Language and Information (7:4, 1998). The proceedings of the international conferences LACL'96, LACL'97, LACL'98, LACL'2001, LACL'2005, LACL'2011 appeared in the series Lecture Notes in Artificial Intelligence (volumes 1328, 1582, 2014, 2099, 3492, 6736), and the proceedings of LACL 2012 in Lecture Notes in Computer Science (volume 7351) published by Springer. 

IMPORTANT DATES

Paper submission deadline: March 15, 2014
Notification of acceptance: April 5, 2014
Camera ready copies due: April 15, 2012
Conference dates: June 18-20, 2014
CONTACTS

soloviev (at) irit (dot) fr and asher (at) irit (dot) fr, co-chairs of LACL 2014

FYI--Bertrand Russell Visiting Professorship--McMaster University

FYI--Bertrand Russell Visiting Professorship 

The Department of Philosophy invites applications for a Visiting Professorship in Russell and the History of Early Analytic Philosophy. McMaster University, which houses the Bertrand Russell Archives and the Bertrand Russell Research Centre, is one of the leading centres for research on Russell's philosophy.

The Visiting Professorships, one of which will be available each year, are intended for established scholars whose research would be benefited by access to the Bertrand Russell Archives for an extended period. They are tenable for either one or two semesters, and involve the obligation to present at least one paper in the Philosophy Department's Speakers Series and teach one fourth year undergraduate course also open to graduates, preferably on the history of analytic philosophy (although a different topic may be agreed upon with the Chair of the Department of Philosophy), while undertaking research in the Russell Archives. The stipend for teaching the course is up to $15,749.00, depending on rank, in accordance with the standard schedule for overload teaching for 2014/2015. 
It is expected that successful applicants will be on research leave from their home university during the term of their Visiting Professorship and thus can rely on their regular leave salary for their main financial support. The closing date for applications for 2014-15 is April 30, 2014. Applicants should send a copy of their CV together with a description of the research they propose to conduct at the Russell Archives to the Chair ( chphilo@mcmaster.ca ), Department of Philosophy, University Hall 310, McMaster University, Hamilton, Ontario L8S 4K1, Canada. 

03 February 2014

CFP: Midwest Undergraduate Cognitive Science Conference

Call for papers, for your information:
Midwest Undergraduate Cognitive Science Conference

The submission deadline for the 6th annual Midwest Undergraduate Cognitive Science Conference is Saturday, 01.Mar.14. They will be accepting submissions starting 08.Feb.14.

This conference is organized to provide undergraduate cognitive scientists with an opportunity to present their research to their peers from across the Midwest.

[Conference planners] are pleased to welcome Dr. Olaf Sporns as the keynote speaker this year. Dr. Olaf Sporns is a Provost Professor of Psychological and Brain Sciences at Indiana University with a focus in computational cognitive neuroscience. Dr. Sporns is well known for his work with the Human Connectome Project.

Abstracts should be between 150-300 words, and potential topics span the full breadth of cognitive science. Many students have taken this as an opportunity to further develop a project they have started in a course, or to receive feedback on independent research.

Undergraduate students who wish to present a poster or talk can submit their abstracts through a form on the submissions page on the MUCSC website (http://mucsc.info/submissions.php).

The deadline for submissions is 01.Mar.14. Abstracts will be peer-reviewed by the program committee and notifications will be emailed by 22.Mar.13.

The conference will be held at the Bloomington, IN campus of Indiana University on Friday, 11.Apr.14 and Saturday, 12.Apr.14.


Undergraduates are invited to submit their research projects as a 15 minute talk or a poster through the online submission form at http://mucsc.info/submissions.php. [Planners] encourage submissions from a wide range of disciplines, including philosophy, psychology, artificial intelligence, linguistics, economics, criminal justice, informatics, anthropology, and the humanities. The aim of the conference is to provide a venue for young, aspiring cognitive scientists to share their work with both peers and senior faculty, and to foster relationships among undergraduates throughout the Midwest region.

Everyone interested in Cognitive Science, regardless of age, is encouraged to register to attend the conference at http://mucsc.info/registration.php. Lunch will be catered, and they want to make sure there's enough for everyone!

For more information, see www.mucsc.info or send an email to cogsconf (at) indiana (dot) edu.

Forwarded to me by Joyce Uland, MUCSC Co-chair.

Brandon Butler to speak on intellectual property law

This is for your information:

Brandon Butler will speak on intellectual property law at the Billy

Date: Wed, 26.Feb.14
Time: 12:30-13:45
Atrium Auditorium

His short bio: Brandon Butler is the Practitioner-in-Residence at the Glushko-Samuelson Intellectual Property Clinic at the Washington College of Law at American University in Washington, D.C.  Before teaching law, he was the Director of Public Policy Initiatives at the Association of Research Libraries (ARL).  Before that, he was an associate in the Media and Information Technologies practice group at the Washington, D.C. law firm Dow Lohnes PLLC.  He received his J.D. from the University of Virginia School of Law.

I may have a conflict, but if I'm free, I plan to be there. 

02 February 2014

Geometric Stacker models

Melissa and Doug's Geometric Stackers on my workbench. A piece or two is missing from peg 3, btw.


I don't recall playing with stacker toys as a kid. Blocks, play-doh, stuff like that, but toys where you stack wood pieces on pegs didn't show up on my radar until I started using them in work on logic.

As part of a larger research problem I'm exploring on the logic of toys, I have some questions about stackers. But first a few observations.

Two obvious big facts about stackers. First, there are lots of brightly colored, variously shaped pieces (they have holes in them that accommodate the pegs they are stacked on). And second, there are those pegs. The pegs force the pieces into some arrangement or other, but the pieces have their various properties independent of their arrangement.

The stackers thus permit a grid system: peg 1, first position--perhaps 1.A, something like that--and on in the obvious way: 1.A, 1.B, 1.C, and so on. The height of the peg and the thickness (height) of each piece, if they are all similar, thus determine how many slots each peg has.

Suppose we create a model as our initial state in which piece a and piece b, both circular, are stacked on peg 1 in the first two positions (1.A and 1.B). Then suppose we create a model to be our final state, in which piece a is still at 1.A, but octagonal piece c is at 2.A and octagonal piece d is at 3.A. (Sorry--next time I'll have more pics. Maybe I'll move this discussion to my Tumblr blog.)

I'll hold off on the list of sentences in the model until Tumblr. For now, let me point out a couple of constraints on the Stackers:

  1. The universe has pegs, numbered/slotted into a grid system (as I've been suggesting).
  2. It will help enormously to have functions to make instructions simpler: $remove _top-most_ piece _early-most_$. The $_top-most_$ function is a space function (describing location in space), while the $_early-most_$ function is a time function (describing position in time).
Enough for now.