Encoding disjunctive-scheduling_domain.gringo

Name disjunctive-scheduling_domain.gringo
Class Tree
Submitter Martin Gebser
Author Martin Gebser and Roland Kaminski
Description This logic program encodes the computation of sufficient intervals for tasks' starting times. That is, if there is a solution for an instance, there is at least one solution such that all tasks' starting times lie in-between X and Y as given by mintime(X) and maxtime(Y) in an answer set.

This functionality can be used to figure out values to insert into statement "$domain(X..Y)" used by clingcon (cf. disjunctive-scheduling_decision.clingcon).
Created 2009-05-07 16:30
Modified 2009-05-07 16:37
Language Features
Compatible Instance Classes
Input Predicates
  • est/2
  • let/2
  • task/2
Output Predicates
  • maxtime/1
  • mintime/1
Encoding Parameter
    Standalone Help No