Goal dependency generation #197

New Issue

aniva · 2025-04-24T08:45:23-07:00

aniva commented

2025-04-24 08:45:23 -07:00

Consider if we have 3 goals in a state:

x
|- Nat
1
|- x <= 5
2
|- x <= 10

Then it should be possible to solve ?2 with ?1.

Is there a way to encode this?

Consider if we have 3 goals in a state: ``` x |- Nat 1 |- x <= 5 2 |- x <= 10 ``` Then it should be possible to solve `?2` with `?1`. Is there a way to encode this?

aniva added the

part/Goal

category

feature

labels 2025-04-24 08:45:23 -07:00

aniva self-assigned this 2025-04-24 08:45:23 -07:00

aniva changed title from ~~Condition Unification~~ to Subsumation of Goals

2025-06-17 10:30:35 -07:00

aniva changed title from ~~Subsumation of Goals~~ to Isomorphism and Subsumption

2025-06-25 10:46:06 -07:00

aniva changed title from ~~Isomorphism and Subsumption~~ to Goal dependency generation

2025-06-25 10:46:23 -07:00

aniva added a new dependency 2025-06-26 13:51:02 -07:00

#219 feat(goal): Add unshielded tactic execution mode

aniva commented

2025-06-26 13:51:19 -07:00

This will require one tactic to act on two goals at the same time, which is doable, given #219.

Sign in to join this conversation.

No Label

No Milestone

No project

No Assignees

1 Participants

Notifications

Due Date

The due date is invalid or out of range. Please use the format 'yyyy-mm-dd'.

No due date set.

Depends on

#219 feat(goal): Add unshielded tactic execution mode

aniva/Pantograph

Reference: aniva/Pantograph#197