Formulas #
This file provides typeclasses for formulas and different operations these formulas can support. Note that this file does not implement any of these operations, but it formalizes what these operations should do.
Formula #
Type class for formulas with variables Fin n. The variables are ordered by ordering <.
- vars (φ : R) : STRIPS.VarSet n
The variables associated with the formula
φ. Note that not all of these variables need to 'appear' inφ. - models (φ : R) : Models n
The models of the formula
φ - models_equiv_right (φ : R) (M M' : Model n) : (∀ i ∈ vars φ, M i = M' i) → M ∈ models φ → M' ∈ models φ
If two assignments coincide on the variables of
φ, then the second is a model ofφif the first one is a model ofφ.
Instances
Renaming #
- mono : StrictMonoOn self.rename ↑dom
Instances For
Equations
- Validator.Model.rename r M i = M (r.rename i)
Instances For
Instances For
Equations
Instances For
Equations
Instances For
Equations
- Validator.CNF.rename r φ = List.map (Validator.Clause.rename r) φ
Instances For
Equations
- Validator.VarSet.rename r V = V.map r.rename
Instances For
Equations
- Validator.PartialModel.rename r M h1 = { pos := Validator.VarSet.rename r M.pos, neg := Validator.VarSet.rename r M.neg, disjoint := ⋯ }
Instances For
Operations on Formulas #
- consistent (φ : R) : Bool
Instances
The time complexity of andList is generally bad, therefore it should only be used
if the number of conjuncts is bounded.
Equations
Instances For
The timecomplexity of andList is generally bad, therefore it should only be used
if the number of conjuncts is bounded.
Equations
Instances For
- ofPartialModel : PartialModel n → R
Instances
Renaming consistent with order
- models_rename (φ : R) (V : STRIPS.VarSet n) (r : Renaming V) (h : vars φ ⊆ V) : models (rename φ r h) = Model.rename r ⁻¹' models φ