PartialModel #
This file provides the definition of partial models and operations and lemmas for working with them.
Partial models are partial assignments. In contrast to Model, these are used at runtime.
- pos : STRIPS.VarSet n
- neg : STRIPS.VarSet n
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[instance_reducible]
@[instance_reducible]
instance
Validator.PartialModel.instMembershipLiteral
{n : ℕ}
:
Membership (Literal n) (PartialModel n)
Equations
- One or more equations did not get rendered due to their size.
Instances For
Instances For
def
Validator.PartialModel.insert
{n : ℕ}
(M : PartialModel n)
(l : Literal n)
(h : ¬l.var ∈ M.vars)
:
The partial model equivalent to the conjunction of the given partial model and the given literal.
Equations
Instances For
@[simp]
theorem
Validator.PartialModel.vars_insert
{n : ℕ}
{M : PartialModel n}
{l : Literal n}
{h : ¬l.var ∈ M.vars}
:
theorem
Validator.PartialModel.vars_insert?
{n : ℕ}
{M M' : PartialModel n}
{l : Literal n}
(h : M.insert? l = some M')
:
def
Validator.PartialModel.foldl
{α : Sort u_1}
{n : ℕ}
(f : α → Literal n → α)
(init : α)
(M : PartialModel n)
:
α
Equations
- One or more equations did not get rendered due to their size.
Instances For
The conjunction of two compatible partial models.
Instances For
@[simp]
@[simp]
@[simp]
theorem
Validator.PartialModel.mem_and
{n : ℕ}
{M1 M2 : PartialModel n}
{h : M1.Compatible M2}
{l : Literal n}
:
@[simp]
@[simp]
Returns the conjunction of two partial models.
Returns none if the conjunction of the two partial models is inconsistent.
Equations
Instances For
Restrict the given partial model to the given set of variables.
Instances For
@[simp]
@[simp]
@[simp]
theorem
Validator.PartialModel.vars_restrict
{n : ℕ}
{M : PartialModel n}
{vars : STRIPS.VarSet n}
:
@[simp]
theorem
Validator.PartialModel.mem_restrict
{n : ℕ}
{M : PartialModel n}
{vars : STRIPS.VarSet n}
{l : Literal n}
:
theorem
Validator.PartialModel.models_subset_models_restrict
{n : ℕ}
{M : PartialModel n}
{vars : STRIPS.VarSet n}
:
@[simp]
theorem
Validator.PartialModel.restrict_inter
{n : ℕ}
{M : PartialModel n}
{V1 V2 : STRIPS.VarSet n}
:
@[simp]
theorem
Validator.PartialModel.restrict_vars_eq_self_iff
{n : ℕ}
{M : PartialModel n}
{vars : STRIPS.VarSet n}
:
@[simp]
@[simp]
theorem
Validator.PartialModel.and_restrict_left
{n : ℕ}
{M1 M2 : PartialModel n}
{h : M1.Compatible M2}
:
@[simp]
theorem
Validator.PartialModel.and_restrict_right
{n : ℕ}
{M1 M2 : PartialModel n}
{h : M1.Compatible M2}
:
def
Validator.PartialModel.expand
{n : ℕ}
(M : PartialModel n)
(V : STRIPS.VarSet n)
:
List (PartialModel n)
Expand the given partial model M to 2 ^ |V \ M.vars| partial models over M.vars ∪ V.
Instances For
theorem
Validator.PartialModel.vars_of_mem_expand
{n : ℕ}
{M : PartialModel n}
{V : STRIPS.VarSet n}
{M' : PartialModel n}
:
theorem
Validator.PartialModel.mem_expand
{n : ℕ}
{M : PartialModel n}
{V : STRIPS.VarSet n}
{M' : PartialModel n}
:
theorem
Validator.PartialModel.expand_restrict
{n : ℕ}
{M : PartialModel n}
{V : STRIPS.VarSet n}
{M' : PartialModel n}
:
theorem
Validator.PartialModel.subset_models_of_expand
{n : ℕ}
{M : PartialModel n}
{V : STRIPS.VarSet n}
(M' : PartialModel n)
:
@[simp]
Equations
- M.toCube = Validator.PartialModel.foldl (fun (δ : Validator.Cube n) (l : Validator.Literal n) => l :: δ) [] M
Instances For
@[simp]
@[simp]
Equations
- M.toCNF = Validator.PartialModel.foldl (fun (φ : Validator.CNF n) (l : Validator.Literal n) => [l] :: φ) [] M
Instances For
Translate δ to a partial model. Returns none if δ is inconsistent.
Equations
Instances For
@[simp]