Quantification in modal logic is interesting from a technical and philosophical stand-point. Here we look at quantification in auto-epistemic logic, which is a modal logic of self-knowledge.
When heuristic problem-solving programs are faced with large data bases that contain numbers of facts far in excess of those needed to solve any particular problem, their performance rapidly deteriorates.
This paper deals with a specific approach to the problem of reference that I call the descriptive model. In particular, I am going to examine some relations between this model and a certain distinction between referential and attributive uses of definite descriptions.
This manual describes Rex, a programming language for specifying machines by declaratively describing their behavior. The Rex language consists of a set of Lisp functions that define primitive Rex machines and provides methods for building complex machines out of simpler components.
This presentation presents an overview of the architecture of problem-based learning (PBL) and a faculty perspective on how it provided support for classroom implementation of PBL in a STEM workforce course.
Simpson's paradox exemplifies a class of problems that can arise when the logic used to reason about the semantics of propositional sentences does not adequately capture certain dependencies between sentences of interest.
A unified account of interpretation preferences of stressed and unstressed pronouns in discourse. The central intuition is the Complementary Preference Hypothesis that predicts the interpretation preference of a stressed pronoun from that of an unstressed pronoun in the same discourse position.
This report describes the Austin Independent School District’s recent effort to improve its high schools through a variety of initiatives led by the Office of District Redesign.
