concepts.pdsketch.strips.strips_expression.SSimpleBoolExpression#

class SSimpleBoolExpression[source]#

Bases: SBoolOutputExpression

The representation of a boolean expression. Note that since the negation is recorded in the raw StripsBoolPredicateApplicationExpression, we do not need to record it here. Therefore, in this class, we only need to record whether the expression is an AND or an OR.

Methods

`ground`(variable_dict[, state])	Return a new expression with all variables grounded according to the given variable dictionary.
`iter_effect_predicates`()	Iterate over the effect predicate names in the expression.
`iter_precondition_predicates`()	Iterate over the precondition predicate names in the expression.

Attributes

`is_conjunction`	Whether the expression is a conjunction.
`arguments`	The arguments of the expression.
`is_disjunction`	Whether the expression is a disjunction.

__init__(arguments, is_disjunction)[source]#

Initialize a boolean expression.

Parameters:

arguments (Sequence[SBoolOutputExpression]) – the arguments of the expression.
is_disjunction (bool) – whether the expression is a disjunction.

__new__(**kwargs)#

ground(variable_dict, state=None)[source]#

Return a new expression with all variables grounded according to the given variable dictionary.

Parameters:

variable_dict (Dict[str, str])
state (SState | Set[str] | None)

iter_effect_predicates()#

Iterate over the effect predicate names in the expression.

Return type:: Iterable[str]

iter_precondition_predicates()[source]#

Iterate over the precondition predicate names in the expression.

Return type:: Iterable[str]

arguments: Sequence[SBoolOutputExpression]#: The arguments of the expression.

property is_conjunction: bool#: Whether the expression is a conjunction.

is_disjunction: bool#: Whether the expression is a disjunction.