Skip to content

GitLab

  • Menu
Projects Groups Snippets
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in / Register
  • U updater
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 37
    • Issues 37
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 1
    • Merge requests 1
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Deployments
    • Deployments
    • Releases
  • Packages & Registries
    • Packages & Registries
    • Package Registry
    • Container Registry
    • Infrastructure Registry
  • Analytics
    • Analytics
    • Value stream
    • CI/CD
    • Repository
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • Turris
  • updater
  • updater
  • Merge requests
  • !103

Merged
Created Aug 12, 2016 by Ghost User@ghostContributor

SAT-based dependency computation

  • Overview 17
  • Commits 4
  • Changes 2

This design describes how to compute what packages need to be installed using a SAT solver. Please see if it can be understood. Also, any counter-examples where this doesn't work, and ideas to lower the number of iterations needed, are welcome.

This is related to #18 (closed). I'll split the work into some tickets once this is reviewed.

Assignee
Assign to
Reviewer
Request review from
Time tracking
Source branch: sat-design