Basic definitions for formulas #
This file provides definitions and lemmas for models, literals, clauses, cubes, CNF-formulas and DNF-formulas.
Model #
@[reducible, inline]
Model is usually in the in the context of a formula, where it represents a model of this formula,
i.e. an assignment of variables making the formula true.
It is used to show the correctness of operations.
Equations
- Validator.Model n = (Fin n → Prop)
Instances For
@[reducible, inline]
A set of models.
Equations
- Validator.Models n = Set (Validator.Model n)
Instances For
Literal #
Equations
Instances For
@[instance_reducible]
Clause #
@[reducible, inline]
A clause is a disjuction of literals.
Equations
Instances For
Equations
Instances For
Cube #
@[reducible, inline]
A cube is a conjunction of literals.
Equations
- Validator.Cube n = List (Validator.Literal n)
Instances For
Equations
Instances For
Equations
- δ.consistent = List.all δ fun (l : Validator.Literal n) => decide ¬l.negate ∈ δ
Instances For
The negation of a clause
Equations
Instances For
The negation of a cube
Equations
Instances For
CNF #
@[reducible, inline]
A CNF-formula is a conjunction of clauses.
Equations
- Validator.CNF n = List (Validator.Clause n)
Instances For
Equations
- φ.vars = List.foldr (fun (γ : Validator.Clause n) (V : STRIPS.VarSet n) => V ∪ γ.vars) ∅ φ
Instances For
DNF #
@[reducible, inline]
A DNF-formula is a conjunction of cubes.
Equations
- Validator.DNF n = List (Validator.Cube n)