Linear time-dependent constraints programming with MSVL

  • Authors:
  • Qian Ma;Zhenhua Duan

  • Affiliations:
  • Institute of Computing Theory and Technology, Xidian University, Xi'an, P.R. China 710071;Institute of Computing Theory and Technology, Xidian University, Xi'an, P.R. China 710071

  • Venue:
  • Journal of Combinatorial Optimization
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates specifying and solving linear time-dependent constraints with an interval temporal logic programming language MSVL. To this end, linear constraint statements involving linear equality and non-strict inequality are first defined. Further, the time-dependent relations in the constraints are specified by temporal operators, such as [InlineEquation not available: see fulltext.]. Thus, linear time-dependent constraints can be smoothly incorporated into MSVL. Moreover, to solve the linear constraints within MSVL by means of reduction, the operational semantics for linear constraints is given. In particular, semantic equivalence rules and transition rules within a state are presented, which enable us to reduce linear equations, inequalities and optimization problems in a convenient way. Besides, the operational semantics is proved to be sound. Finally, a production scheduling application is provided to illustrate how our approach works in practice.