- Problem Set 10 CSC 280, 2006
- Problem Set 9 CSC 280, 2006
- Dynamic Skolemization Lenhart Schubert
- Measuring and Improving the Quality of World Knowledge Extracted From WordNet
- Extracting and Evaluating General World Knowledge from the Brown Lenhart Schubert
- Department of Computer Science CSC 247/447 and BCS 235
- Inferring State Constraints for DomainIndependent Planning \Lambda Alfonso Gerevini
- Can We Derive General World Knowledge from Texts? Lenhart Schubert
- Department of Computer Science CSC 247/447
- Entailment Inference in a Natural Logic-like General Reasoner Lenhart K. Schubert
- Incorporating Planning and Reasoning into a Self-Motivated, Communicative Agent
- Implicit Skolemization: Efficient Reference to Dependent Lenhart Schubert
- Some Knowledge Representation and Reasoning Requirements for Self-Awareness Lenhart Schubert
- Open Knowledge Extraction through Compositional Language Benjamin Van Durme
- Metareasoning as an Integral Part of Commonsense and Autocognitive Reasoning Fabrizio Morbini and Lenhart Schubert
- Computing adverbial quantifier domains Computer Science
- Department of Computer Science Project Guidelines
- Department of Computer Science CSC 247/447 and BCS 235/535
- Department of Computer Science CSC 247/447 and BCS 235
- Department of Computer Science CSC 247/447 and BCS 235/535
- Some Elements of an Essay Mark Andrews
- Problem Set 9 CSC 280, 2006
- Department of Computer Science CSC 247/447 and BCS 235
- Computing adverbial quanti er domains University of Rochester, Computer Science Department
- Discovering State Constraints in DISCOPLAN: Some New Results Alfonso Gerevini
- Open Extraction of General Knowledge through Compositional Lenhart Schubert and Benjamin Van Durme
- Problem Set 11 CSC 280, 2006
- A New Characterization of Probabilities in Bayesian Networks Lenhart K. Schubert
- Problem Set 8 CSC 280, 2006
- CSC 247/447 Notes updated Sept. 9, 2008 A Quick Introduction to Common Lisp
- Language Understanding as Recognition and Transduction of Numerous Overlaid Lenhart Schubert
- Turing's Dream and the Knowledge Challenge Lenhart Schubert
- Problem Set 8 CSC 280, 2006
- Explanation Closure, Action Closure, and the Sandewall Test Suite
- Problem Set 11 CSC 280, 2006
- To appear in J. Minker (ed.), Logic-Based Arti cial Intelligence, Kluwer Acad. Publ., Dortrecht, 2000. 1 The Situations We Talk about
- Deriving Generalized Knowledge from Corpora using WordNet Abstraction
- Towards Realistic Autocognitive Inference Fabrizio Morbini and Lenhart Schubert
- Can We Derive General World Knowledge from Texts? Lenhart Schubert
- S0004-3702(00)00021-7/FLA AID:1728 Vol.00(0) P.1 (1-42) ELSEV2s 2000/03/24 Prn:29/03/2000; 12:31 AIJ1728 by:R.M. p. 1
- Episodic Logic Meets Little Red Riding Hood : A Comprehensive, Natural Representation for Language Understanding
- Department of Computer Science CSC 247/447 and BCS 235/535
- Problem Set 10 CSC 280, 2006
- Monotonic Solution of the Frame Problem in the Situation Calculus
- From generic sentences to scripts Lenhart Schubert
- Class-Driven Attribute Extraction Benjamin Van Durme, Ting Qian and Lenhart Schubert
- Department of Computer Science CSC 247/447 and BCS 235/535
- A New Characterization of Probabilities in Bayesian Networks Lenhart K. Schubert
- Towards a Consistent Logical Framework for Ontological Analysis
- Combining Self-Motivation with Logical Planning And Inference in a Reward-Seeking Agent
- Evaluation of EPILOG: a Reasoner for Episodic Logic Fabrizio Morbini and Lenhart Schubert
- Towards Adequate Knowledge and Natural Inference Lenhart Schubert, Jonathan Gordon, Karl Stratos, and Adina Rubinoff
