Artificial Intelligence - Special issue on knowledge representation
Scheduling real-time computations with separation constraints
Information Processing Letters
Linear programming
Theoretical Computer Science
Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing
Issues in temporal reasoning for autonomous control systems
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Scheduling Algorithms
Parametric Dispatching of Hard Real-Time Tasks
IEEE Transactions on Computers
Deciding Separation Formulas with SAT
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
SAT-Based Procedures for Temporal Reasoning
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Automatic Verification of Sequential Circuit Designs
CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
Verifying temporal constraints on data in multi-rate transactions using timed automata
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
An Analysis of Totally Clairvoyant Scheduling
Journal of Scheduling
A greedy strategy for detecting negative cost cycles in networks
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
Stressing is better than relaxing for negative cost cycle detection in networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
| Hi-index | 0.00 |
Chain Programming is a restricted form of Linear Programming; in a Chain Program, there exists a total ordering on the program variables. In other words, the constraints x1 ≤ x2 ... xn are either implicitly or explicitly part of the constraint system. At the present juncture, it is not clear whether an arbitrary linear program augmented with a chain is easier to solve than linear programs in general, either asymptotically or computationally. However, if the linear program is constituted entirely of difference constraints, then the total ordering results in a number of interesting properties, which are not true of constraint systems in general. Inasmuch as difference constraint logic is an integral part of a number of verification problems in both model-checking and real-time scheduling, our results are of particular importance to these communities.