<--- Back to Details
First PageDocument Content
Automated theorem proving / Boolean algebra / Logic in computer science / Rules of inference / Implicant / Horn clause / Unit propagation / Resolution / Logic programming / Logic / Mathematical logic / Mathematics
Date: 2003-04-29 20:41:47
Automated theorem proving
Boolean algebra
Logic in computer science
Rules of inference
Implicant
Horn clause
Unit propagation
Resolution
Logic programming
Logic
Mathematical logic
Mathematics

Add to Reading List

Source URL: www2.parc.com

Download Document from Source Website

File Size: 772,60 KB

Share Document on Facebook

Similar Documents

Removing Unnecessary Variables from Horn Clause Verification Conditions Emanuele De Angelis∗ and Fabio Fioravanti∗ Alberto Pettorossi∗

DocID: 1tLyP - View Document

Removing Unnecessary Variables from Horn Clause Verification Conditions E. De Angelis (1), F. Fioravanti (1) A. Pettorossi (2), M. ProiettiDEC, University ”G. d’Annunzio” of Chieti-Pescara, Italy

DocID: 1tJl0 - View Document

Solving non-linear Horn clauses using a linear Horn clause solver Bishoksan Kafle, John Gallagher and Pierre Ganty Roskilde University, Denmark and IMDEA Software Institute, Spain HCVS’16 Eindhoven

DocID: 1tIIr - View Document

Solving non-linear Horn clauses using a linear Horn clause solver ∗ Bishoksan Kafle John P. Gallagher

DocID: 1sWXX - View Document

Software engineering / Logic / Mathematical logic / Logic programming / Logic in computer science / Automated theorem proving / Predicate logic / Prolog / Horn clause / Resolution / Partial evaluation / Mereology

Tutorial on Specialisation of Logic Programs J.P. Gallagher Department of Computer Science University of Bristol University Walk Bristol BS8 1TR, U.K.

DocID: 1rncE - View Document