v0.1.0

Features

• model: support fixed and bounded durations #88 (Roland Godet)
• planning: use linear sum to encode duration constraints #88 (Roland Godet)
• grpc: use new duration constraints #88 (Roland Godet)
• model: add denominator to linear terms #88 (Roland Godet)
• Add logging to the solver. #94 (Arthur Bit-Monnot)
• planning: Enable eager propagation during encoding. #94 (Arthur Bit-Monnot)
• planning: Group compatible and exclusive subtasks to avoid explosion of the decomposition tree #94 (Arthur Bit-Monnot)
• solver: Add conflict-base brancher (LRB/VSIDS) to the main solver crate. #94 (Arthur Bit-Monnot)
• planning: Support task network constraints in HDDL. #94 (Arthur Bit-Monnot)
• hddl: Support parameters in task networks. #94 (Arthur Bit-Monnot)
• hddl: Initial support for universal quantification. #94 (Arthur Bit-Monnot)
• planning: Allow retrieving plans in an anytime fashion. #94 (Arthur Bit-Monnot)
• planning: When optimizing, the solver will keep increasing the depth until the maximum is reached. #94 (Arthur Bit-Monnot)
• val: check the epsilon value if provided #93 (Roland Godet)
• up: Provide decomposition information for hierarchical plans. #96 (Arthur Bit-Monnot)

Bug Fixes

• planning: Detect conditions that cannot be encoded as table constraints. #88 (Arthur Bit-Monnot)
• planning: use TIME_SCALE as denominator in ConstraitType::Lt encoding #88 (Roland Godet)
• up: Add missing substitution of duration bounds in constraints. #88 (Roland Godet)
• cp: add a saturation security on sum reasoner #88 (Roland Godet)
• up: replace cohoma problems with satisfiable versions #88 (Roland Godet)
• grpc: raise error when the result gets one #88 (Roland Godet)
• ci: type dict is not subscriptable #88 (Roland Godet)
• solver: Support LT between int and fixed point numerals. #90 (Arthur Bit-Monnot)
• model: FAtom into LinearSum #90 (Roland Godet)
• solver: Support LT between int and fixed point numerals. #90 (Arthur Bit-Monnot)
• model: FAtom into LinearSum #90 (Roland Godet)
• planning: corner case where no explanation could be given for an STN propagation. #94 (Arthur Bit-Monnot)
• build: Some crate were missing anyhow features. #94 (Arthur Bit-Monnot)
• planning: convenience method for equality encoding was broken. #94 (Arthur Bit-Monnot)
• solver: bug in incremental DFS of implication graph. #94 (Arthur Bit-Monnot)
• tools: Fix script to find solvable problems. #94 (Arthur Bit-Monnot)
• val: add all parameters into actions #92 (Roland Godet)
• stn: Disable a test that was not outdated. #94 (Arthur Bit-Monnot)
• val: update factories to new up version #93 (Roland Godet)
• val: stop checking problem support #93 (Roland Godet)
• val: cargo clippy warning #93 (Roland Godet)
• val: minimal delay on condition detection #93 (Roland Godet)
• val: add a timepoint for each action start and end #93 (Roland Godet)
• cp: Substitution was not done for linear eq. #91 (Arthur Bit-Monnot)
• val: Deactivate probably incorrect checks of plan decomposition. #96 (Arthur Bit-Monnot)

Code Refactoring

• model: FAtom into LinearTerm/Sum #88 (Roland Godet)

Tests

• add binary problems from CoHoMa #88 (Roland Godet)
• adaptation for new constant expectations #90 (Roland Godet)
• adaptation for new constant expectations #90 (Roland Godet)

Builds

• Disable tracing logs in release binaries. #94 (Arthur Bit-Monnot)
• up: update version #93 (Roland Godet)

Continuous Integration

• test all binary problems by exploring the folder #88 (Roland Godet)
• stop failing on the first error #88 (Roland Godet)
• planning: Add new {ph}ddl problems to test cases. #94 (Arthur Bit-Monnot)
• planning: Add HDDL Monroe Fully observable domain to test set. #94 (Arthur Bit-Monnot)
• limit parallelism of lcp runs to gain some determinism #94 (Arthur Bit-Monnot)
• update ubuntu and rust versions #94 (Arthur Bit-Monnot)

Chores

• ignore python virtual environment #88 (Roland Godet)
• black format #88 (Roland Godet)
• better print of test results #88 (Roland Godet)
• print a summary of the test results #88 (Roland Godet)
• add color on test results #88 (Roland Godet)
• better print for duration constraints #88 (Roland Godet)
• planning: reactivate preprocessing #88 (Roland Godet)
• planning: use linear term in duration constraint #88 (Roland Godet)
• clippy #88 (Roland Godet)
• clippy #88 (Roland Godet)
• merge branch 'master' into unsupported-features #88 (Roland Godet)
• planning: use linear sum in duration constraints #88 (Roland Godet)
• merge: 'origin/master' into unsupported-features #88 (Roland Godet)
• up: remove bin files #88 (Roland Godet)
• Minor fixes and todos. #88 (Arthur Bit-Monnot)
• clippy #88 (Roland Godet)
• linear: make attributes private #88 (Roland Godet)
• linear: use external crate for lcm #88 (Roland Godet)
• model: clean NFLinearLeq from null items #88 (Roland Godet)
• model: clean NFLinearLeq from items with var ZERO #88 (Roland Godet)
• encode: enforce precedence in STN for duration constraints #88 (Roland Godet)
• solver: convert linear constraint into Lit or MaxDiff when possible #88 (Roland Godet)
• minor changes for merge #88 (Roland Godet)
• linear: group factors by variable before simplification #90 (Roland Godet)
• up-server: handle min_depth option #90 (Roland Godet)
• Clean up implementation of LinearSum. #90 (Arthur Bit-Monnot)
• linear: group factors by variable before simplification #90 (Roland Godet)
• up-server: handle min_depth option #90 (Roland Godet)
• Clean up implementation of LinearSum. #90 (Arthur Bit-Monnot)
• solver: Account for current domains when checking for implication. #94 (Arthur Bit-Monnot)
• planning: Add static mutual exclusion constraints between methods achieving the same task. #94 (Arthur Bit-Monnot)
• planning: Allow a chronicle to support one of several exclusive tasks. #94 (Arthur Bit-Monnot)
• planning: Set more specific scope to decomposition of task-groups. #94 (Arthur Bit-Monnot)
• clippy: Fix lints and update rust version. #94 (Arthur Bit-Monnot)
• planning: Provide tags of literals that identify their role in the encoding. #94 (Arthur Bit-Monnot)
• planning: Add redundant constraint to make any two supporters of the same condition exclusive. #94 (Arthur Bit-Monnot)
• planning: New experimental brancher (causal) #94 (Arthur Bit-Monnot)
• planning: Add implementation of Knoblock's abstraction hierarchy. #94 (Arthur Bit-Monnot)
• planning: Add decomposition to causal branching. #94 (Arthur Bit-Monnot)
• solver: Clean causal brancher. #94 (Arthur Bit-Monnot)
• planning: Only warn in the presence of duplicated symbols. #94 (Arthur Bit-Monnot)
• extract DFS implementation from implication search. #94 (Arthur Bit-Monnot)
• simplify implementation of exclusivity test. #94 (Arthur Bit-Monnot)
• cache search in the implication graph. #94 (Arthur Bit-Monnot)
• planning: Remove redundant constraints for exclsivity of support. #94 (Arthur Bit-Monnot)
• solver: Improve debug fmt for LitSet. #94 (Arthur Bit-Monnot)
• planning: Restore Forward search strategy in default set. #94 (Arthur Bit-Monnot)
• Add commented line to remove time in logs. #94 (Arthur Bit-Monnot)
• planning: Add tracing spans to problem encoding. #94 (Arthur Bit-Monnot)
• Convenience functions for building literals form IAtoms #94 (Arthur Bit-Monnot)
• up: print error message for validator #92 (Roland Godet)
• val: save epsilon explanation #93 (Roland Godet)
• val: simplify epsilon calculation logic #93 (Roland Godet)
• val: use problem's epsilon if provided #93 (Roland Godet)
• val: check epsilon when adding conditions #93 (Roland Godet)
• stn: comment unused variable [clippy warn] #93 (Roland Godet)
• up: print error message for validator #93 (Roland Godet)
• cp: Minor style/doc enhancement around linear constraints. #91 (Arthur Bit-Monnot)
• Flix clippy lints. #96 (Arthur Bit-Monnot)
• up: Minor simplification in solver script. #98 (Arthur Bit-Monnot)
• Update UP version to 1.0 #98 (Arthur Bit-Monnot)

Commits

• 8152c77: Merge branch 'master' into unsupported-features (Roland Godet) #88
• Fix clippy warnings #94 (Arthur Bit-Monnot)
• remove HDDL to-entertainment from tests as it is too close to the CI limit and cause flakyness #94 (Arthur Bit-Monnot)
• e08704a: Merge branch 'master' into ipc-2023-dev (Arthur Bit-Monnot) #94
• 7788c52: Extend chronicle definition and encoding: (Yirmandias) #91
• fix linear #91 (Yirmandias)
• b122cbd: LinearTerm and Linear Sum public attributes for debug purpose (Yirmandias) #91
• d6630cf: [clippy] commented fmt and fmt1 (Yirmandias) #91
• 364fe39: [encode] Temporal relaxation of a task and its methods intervals made optional: (Yirmandias) #91
• bd26058: Encoding takes into account SavedAssignments (Yirmandias) #91
• c6693b6: Parsing support uppercase in String (Yirmandias) #91
• 4872b1d: TIME_SCALE as EnvParam (Yirmandias) #91
• e060e9f: Integrate request from arbimo (Yirmandias) #91
• 2612519: remove scope for lineareq (Yirmandias) #91
• 42f9039: remove assert in encode (Yirmandias) #91
• c0ebc01: fix bug with scope definition in enforce_refinement (Yirmandias) #91
• 0da7c1f: [encode] add scope to linearleq constraint (Yirmandias) #91