v0.2.0

Features

• solver: Add bounds to int type. #100 (Arthur Bit-Monnot)
• up: Allow parsing bounded integer types. #100 (Arthur Bit-Monnot)
• up: Add support for parsing (not solving) simple numeric problems. #100 (Arthur Bit-Monnot)
• encode: convert resource constraints into linear sums #100 (Roland Godet)
• linear: optional var to create constant terms #100 (Roland Godet)
• up: Allow outputing scheduling solutions.. #100 (Arthur Bit-Monnot)
• var: create variable ONE #100 (Roland Godet)
• val: evaluation of bounded numbers #100 (Roland Godet)
• val: support schedule problems #100 (Roland Godet)
• grpc: support upf epsilon #100 (Roland Godet)
• val: check schedule problem constraints #100 (Roland Godet)
• val: support timed effects #100 (Roland Godet)
• val: support activities with parameters #100 (Roland Godet)

Bug Fixes

• encode: support constraint for numeric state variables #100 (Roland Godet)
• encode: stop skipping unbounded integers #100 (Roland Godet)
• model: bind entailed literal to tautology of expression scope #100 (Roland Godet)
• causal: format of state variables #100 (Roland Godet)
• model: use core reification with tautology for lin constr #100 (Roland Godet)
• model: skip non-present constraints during assignment validation #100 (Roland Godet)
• ci: update upf proto version #100 (Roland Godet)
• val: adaptation for upf scheduling #100 (Roland Godet)
• planning: Be conservative in evaluating whether a numeric fluent is used. #100 (Arthur Bit-Monnot)
• val: effect factory with forall param #100 (Roland Godet)
• cp: lower and upper bound getters #100 (Roland Godet)
• cp: set current value of a constant as upper bound #100 (Roland Godet)
• solver: Conversion from FAtom to LinearSum was erroneous. #100 (Arthur Bit-Monnot)
• solver: simplified linear sum in constraint posting #100 (Roland Godet)
• grpc: plan generation result on timeout #100 (Roland Godet)
• cargo clippy warning #100 (Roland Godet)
• cp: set non-precense rather than decide it #100 (Roland Godet)
• cargo clippy warning #99 (Roland Godet)
• val: relax order constraints for empty methods #99 (Roland Godet)
• cargo clippy warning #99 (Roland Godet)
• val: signature of a state variable #100 (Roland Godet)
• val: mock schedule plan creation #100 (Roland Godet)
• val: negative bounds extraction #100 (Roland Godet)
• val: minimal delay error message #100 (Roland Godet)
• val: action applicability for problems with discrete time #100 (Roland Godet)
• val: check init env for effect applicability in actions #100 (Roland Godet)
• cargo clippy warning #100 (Roland Godet)
• cargo clippy warning #100 (Roland Godet)
• deps: Fix compiling bug with itertools (#101) #101 (Jérémy Turi)
• up: Minor fixes to supported problem declarations #104 (Arthur Bit-Monnot)
• up: Remove declared support for pre-1.0 features #104 (Arthur Bit-Monnot)
• up: add ignore domain to allow CI to proceed #104 (Arthur Bit-Monnot)

Documentation

• resources: draft #100 (Roland Godet)
• resources: only consider instantaneous conditions/effects #100 (Roland Godet)
• val: better error message #100 (Roland Godet)

Styles

• val: highlight potential code to fix #99 (Roland Godet)
• val: typo in comments #100 (Roland Godet)

Code Refactoring

• lin sum: replace or_zero by a lit #100 (Roland Godet)
• cp tests #100 (Roland Godet)
• val: add bounds to Value::Number #100 (Roland Godet)
• val: move extract_bounds util function #100 (Roland Godet)
• val: get epsilon from problem in dedicated method #100 (Roland Godet)
• val: check fluent bounds in dedicated method #100 (Roland Godet)
• val: use env.state for Act::apply() #100 (Roland Godet)
• val: split action application into atomic methods #100 (Roland Godet)
• val: distinction between continuous and discrete time #100 (Roland Godet)
• val: rename csp start/end ids #100 (Roland Godet)
• val: move rational from atom method #100 (Roland Godet)

Tests

• cp: multiple variables #100 (Roland Godet)
• cp: check propagation and ub setting results #100 (Roland Godet)
• cp: check negative and null factors #100 (Roland Godet)
• cp: check sum with literals #100 (Roland Godet)
• cp: explanations #100 (Roland Godet)
• linear: add unit tests #100 (Roland Godet)
• val: bounds in effects #100 (Roland Godet)

Builds

• update unified-planning version #100 (Roland Godet)

Chores

• build: Put all regex dependency in workspace. #100 (Arthur Bit-Monnot)
• planning: Rename StateFun to Fluent #100 (Arthur Bit-Monnot)
• planning: Refactor state variable representation to have the Fluent immediately available in it. #100 (Arthur Bit-Monnot)
• up: Add features that will be supported after simple numeric planning support is complete. #100 (Arthur Bit-Monnot)
• encode: use lit in lin sum of resource constraints #100 (Roland Godet)
• encode: debug num resource constraints #100 (Roland Godet)
• encode: filter non present effects and conditions #100 (Roland Godet)
• encode: adapt coherence, support and mutex for increases #100 (Roland Godet)
• reif: eval of lin constraint #100 (Roland Godet)
• merge: 'master' into 'numeric-planning' #100 (Roland Godet)
• up: update to last version #100 (Roland Godet)
• up: update support kind for solver and validator #100 (Roland Godet)
• up: update supported kind for solver #100 (Roland Godet)
• up: Update unified planning dependency to support scheduling problems. #100 (Arthur Bit-Monnot)
• up: Add convenience method to query a problem type. #100 (Arthur Bit-Monnot)
• up: Set default log level to INFO. #100 (Arthur Bit-Monnot)
• up: If a problem has no templates, then fix expansion depth. #100 (Arthur Bit-Monnot)
• Convenience method to check is a type is numeric. #100 (Arthur Bit-Monnot)
• up: Add direct support for LEQ (previously required compiling to LT). #100 (Arthur Bit-Monnot)
• up: Add direct support for LEQ (previously required compiling to LT). #100 (Arthur Bit-Monnot)
• Update unified-planning version #100 (Arthur Bit-Monnot)
• cp: add LinearSumLeq.active in explanation #100 (Roland Godet)
• ignore coverage files #100 (Roland Godet)
• ignore .env file #100 (Roland Godet)
• cp: try to force non-precense of elem when ub cannot be set #100 (Roland Godet)
• merge: 'master' into 'numeric-planning' #100 (Roland Godet)
• solver: make LinearTerm attributes private #100 (Roland Godet)
• linear: use ONE variable for constants #100 (Roland Godet)
• solver: use simplified linear sum #100 (Roland Godet)
• val: disable convertion log #99 (Roland Godet)
• merge: 'fix/val/97' into 'feat/val/sched' #100 (Roland Godet)
• val: declare supporting SCHEDULING & BOUNDED_TYPES #100 (Roland Godet)
• val: add Duration factory #100 (Roland Godet)
• val: add Activity factory #100 (Roland Godet)
• val: add Fluent factory #100 (Roland Godet)
• val: return Result when bounding a fluent #100 (Roland Godet)
• val: store fluent type in its name #100 (Roland Godet)
• val: check fluent bounds when setting the value #100 (Roland Godet)
• val: add mock schedule problem #100 (Roland Godet)
• val: add mock schedule plan #100 (Roland Godet)
• val: check if problem is schedule #100 (Roland Godet)
• val: update temporal detection for discrete time #100 (Roland Godet)
• val: check if plan is schedule and is coherent with problem #100 (Roland Godet)
• val: allow increase effects on the same fluent at the same time #100 (Roland Godet)
• val: check fluent bounds after applying an action #100 (Roland Godet)
• val: add TODO #100 (Roland Godet)
• val: save is discrete time problem in env #100 (Roland Godet)
• val: save is schedule problem in env #100 (Roland Godet)
• val: Minor style fix #99 (Arthur Bit-Monnot)
• up: update deps version #100 (Roland Godet)
• model: Minor doc improvement. #100 (Arthur Bit-Monnot)

Reverts

• val: Deactivate probably incorrect checks of plan decomposition. #99 (Roland Godet)
• val: highlight potential code to fix #99 (Roland Godet)

Commits

• 85ee951: chore(linear|simplify): group constant terms into upper bound (Roland Godet) #100
• af50b74: chore(linear|propagator): filter watches (Roland Godet) #100
• 988316f: chore(linear|propagator): watch precense literal (Roland Godet) #100
• f35cdf5: chore(val|grpc): show invalid message (Roland Godet) #99
• dc521da: fix(val|csp): enforce variable domain if options is not empty (Roland Godet) #99
• 5a05fc8: chore(grpc|val): add verbose mode from env param (Roland Godet) #100
• 342f780: feat(val|sched): handle goals (Roland Godet) #100
• 3c94766: [up] Support new finer grained problem types (Arthur Bit-Monnot) #104
• 8561f4a: [up] Update protobuf definition (Arthur Bit-Monnot) #104
• Update UP upstream version #104 (Arthur Bit-Monnot)
• up: Use UP master branch #104 (Arthur Bit-Monnot)