<--- Back to Details
First PageDocument Content
Mathematical logic / Constraint satisfaction / Complexity of constraint satisfaction / Function / Entailment / Envelope / Horn clause / Constraint programming / Logic / Mathematics
Date: 2011-06-29 07:09:50
Mathematical logic
Constraint satisfaction
Complexity of constraint satisfaction
Function
Entailment
Envelope
Horn clause
Constraint programming
Logic
Mathematics

Tractable Set Constraints

Add to Reading List

Source URL: ijcai.org

Download Document from Source Website

File Size: 680,80 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