Skip to content
GitLab
Projects Groups Snippets
  • /
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
  • Spot Spot
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 136
    • Issues 136
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 1
    • Merge requests 1
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Deployments
    • Deployments
    • Environments
    • Releases
  • Monitor
    • Monitor
    • Incidents
  • Analytics
    • Analytics
    • Value stream
    • CI/CD
    • Repository
  • Wiki
    • Wiki
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • SpotSpot
  • SpotSpot
  • Issues
  • #2
Closed
Open
Issue created Dec 06, 2014 by Alexandre Duret-Lutz@adlOwner

find a way to reduce {b*;r} = (b W r) when r is satisfiable

Commit 11568666 removed the following rules

{b*;r} = b W r
!{b*;r} = !b M !{r}

because it is only true when r is satisifiable, but the code did not check that.

Currently the only way we have to ensure that r is satisifiable is to translate it into an automaton. Doing so seems unlikely to be efficient.

But there are many formulas that we can tell as satisfiable without even translation: for instance any SERE that do not involve &, &&, and false is satisfiable. So maybe each formula could have a Boolean property that tells when it is trivially satisfiable.

Assignee
Assign to
Time tracking