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

	Under consideration for publication in Theory and Practice of Logic Programming 1 Horn Clauses as an Intermediate Representation for Program Analysis and Transformation∗ DocID: 1xUvR - View Document
	Differentiable Inductive Logic Programming Richard Evans, Ed Grefenstette @LittleBimble, @egrefen https://jair.org/index.php/jair/article/view/11172 DocID: 1xTa2 - View Document
	WHAT IS SPACECHEM? SpaceChem is an intriguing, "problem-solving centric" puzzle game by Zachtronics Industries that combines the logic of computer programming with the scientific domain of chemistry, set in an original s DocID: 1vmld - View Document
	Experiences Using an Interactive Presentation Platform in a Functional and Logic Programming Course DocID: 1uM8H - View Document
	See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publicationAnalysis of Performance of Various Activation Functions for doing the logic programming in Hopfield DocID: 1uzA8 - View Document