Theory Extension

Define custom constraint types to extend the Information Systems theory. These constraints can be reused across projects.

Constraint Name

Constraint Logic (JavaScript)

SAT / Logic Checker

Check the satisfiability of logical formulas. Use boolean operators: AND (&&), OR (||), NOT (!).

Formula (CNF or DNF)

How to use:

Variables: Use letters (A, B, C, X, Y, Z, etc.)
AND: Use "AND" or "&&"
OR: Use "OR" or "||"
NOT: Use "NOT " or "!"
Example: (A AND B) OR (NOT A AND C)

Information Systems Theory

Mathematical foundation based on university-level IS theory.

Core Sets

P - Set of all predicators (roles)
O - Set of all objects (entities, labels, power types)
E ⊆ O - Set of entity types
F - Set of fact types
L ⊆ O - Set of label types
G ⊆ E - Set of power types
S ⊆ E - Set of sequence types

Key Functions

Base: P → O - Maps predicators to their object types
Pop: O → 𝒫(Ω) - Population function (instances)
Fact: F → 𝒫(P) - Maps fact types to their predicators

Constraints

Uniqueness: Ensures unique combinations (PRIMARY KEY)
Mandatory: Total role participation (NOT NULL)
Frequency: Min/max occurrence limits
Subset/Equality: Role relationships
Exclusion: Mutually exclusive facts
Custom: User-defined validation logic