Theorem-Proving by Resolution as a Basis for Question-Answering Systems Cordell Green Stanford Research Institute Menlo Park, California

First Page		Document Content
Date: 2011-11-16 13:42:21 Mathematical logic Logic Mathematics Model theory Automated theorem proving Predicate logic Semantics Logic programming Resolution First-order logic Skolem normal form Substitution		Theorem-Proving by Resolution as a Basis for Question-Answering Systems Cordell Green Stanford Research Institute Menlo Park, California Add to Reading List Source URL: www.kestrel.edu Download Document from Source Website File Size: 255,21 KB Share Document on Facebook

	On Skolemization in constructive theories Matthias Baaz∗ Rosalie Iemhoff Inst. for Discrete Math. and Geometry E104 DocID: 1rdlF - View Document
	Context-givenness vs. existential quantification Salvador Mascarenhas New York University This paper argues that there are strong parallelisms between indefinite noun phrases and two seemingly unrelated constructions, na DocID: 1qSBy - View Document
	Eskolemization in intuitionistic logic Matthias Baaz∗ Inst. for Discr. Math. and Geom. Technical University Vienna Wiedner HauptstrasseVienna, Austria DocID: 1qBJr - View Document
	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning” DocID: 1pBEb - View Document
	Skolemization, Most General Unifiers, First-Order Resolution Torsten Hahmann CSC 384, University of Toronto March 07, 2011 DocID: 1ot1b - View Document