1997-Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP

First Page		Document Content
Date: 2006-01-10 19:20:44 Automated theorem proving Boolean algebra Logic in computer science Logic programming Resolution Rewriting Clausal normal form Valuation Propositional calculus Logic Mathematical logic Mathematics		1997-Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP Add to Reading List Source URL: aaai.org Download Document from Source Website File Size: 958,89 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