11 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-14 21:00:52 Mathematical logic Logic Model theory Metalogic Predicate logic Formal methods Resolution First-order logic Skolem normal form Automated theorem proving Quantifier Axiom		11 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: 1,72 MB Share Document on Facebook

	Alloy as an Introduction to Formal Methods DocID: 1xVY1 - View Document
	Integrated Formal Methods DocID: 1xVBb - View Document
	Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon University DocID: 1xUHE - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Inferring Event Stream Abstractions Sean Kauffman · Klaus Havelund · Rajeev Joshi · Sebastian Fischmeister DocID: 1xUCm - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ DocID: 1xUrV - View Document