Constraint System

Author:
Salim PERCHY
Includes:
<iostream>
<vector>
<deque>
<map>
<algorithm>
<functional>
<random>
<boost/graph/adjacency_list.hpp>
<boost/graph/transitive_closure.hpp>
<boost/graph/graph_utility.hpp>
<boost/graph/copy.hpp>

Introduction

A Constraint System (CS for short) is a complete algebraic lattice, where its elements represent information.

Discussion

A CS is a tuple ⟨cons, cons₀, ⊑, ⨆, ⨅, true, false⟩ where

cons : Set of elements of the CS.

cons₀ : Set of compact elements of the CS. Cons₀ ⊆ Cons. -- NOT YET IMPLEMENTED --

⊑ : Ordering binary relation (reflexive, antisymmetric and transitive). When c ⊑ d we say c is entailed by d and d entails c.

⨆ : Join set operator. Least Upper Bound (LUB) between elements of the CS.

⨅ : Meet set operator. Greatest lower bound (GLB) between elements of the CS.

⊥ : Global infima of CS, also called the bottom. All elements entail it.

⊤ : Global suprema of CS, also called the top. All elements are entailed by it.

Updated:
Monday, January 25, 2016

Classes

cs

The Constraint System base class.

 

Last Updated: Monday, January 25, 2016