A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Solving Systems of Difference Constraints Incrementally
1999
Algorithmica
Preserved Fulltext
This paper presents a new efficient incremental algorithm for maintaining a solution to a system of difference constraints. ...
Difference constraints systems consisting of inequalities of the form x i − x j ≤ b i, j occur in many applications, most notably those involving temporal reasoning. ...
Consequently, an incremental algorithm for maintaining the SSoSP solution can be used to maintain the solution of a system of difference constraints. ...
doi:10.1007/pl00009261
fatcat:lkdcxv2zrbef7ov46k6evpxdmi
Solving Systems of Difference Constraints Incrementally with Bidirectional Search
2004
Algorithmica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose an incremental algorithm for the problem of maintaining systems of difference constraints. ...
As a difference from the unidirectional approach of Ramalingam et al. [16] , it employs bidirectional search, which is similar to that of Alpern et al. [1] , and has a bounded runtime complexity in the ...
We thank an anonymous referee for valuable suggestions that significantly improved the presentation of this paper. ...
doi:10.1007/s00453-004-1081-6
fatcat:7mb7rpwr4vdffljzsorctbeory
Augmented Lagrangian method for imposing nonlinear multi freedom constraints in static analysis for frames using FEM
2021
E3S Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The process of imposing boundary constraints is developed by changing the assembly stiffness equation to produce a modified system of equation considering nonlinear multi freedom constraints. ...
Based on the Newton Raphson method the incremental-iterative algorithm for solving the nonlinear balanced equations is established. ...
Incremental equation Method for solving the nonlinear system of equation (8) based on dividing the total load into incremental load step [9, 10] . ...
doi:10.1051/e3sconf/202128101010
fatcat:da4f5ga3xnbife26d56k5oj7vq
Applying Incremental Answer Set Solving to Product Configuration
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We demonstrate how to use this technique to solve product configurations problems incrementally. Every step of the incremental solving process corresponds to a predefined configuration action. ...
In this paper, we apply incremental answer set solving to product configuration. Incremental answer set solving is a step-wise incremental approach to Answer Set Programming (ASP). ...
To describe the constraints of the domain two different mechanisms are used. ...
arXiv:2207.08599v1
fatcat:u2uev7legbdufaweajlo32bwim
A co-contextual formulation of type rules and its application to incremental type checking
2015
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This way, the typing context coordinates type checking in otherwise independent subexpressions, which inhibits parallelization and incrementalization of type checking. ...
We describe a method for systematically constructing a co-contextual formulation of type rules from a regular context-based formulation and we show how co-contextual type rules give rise to incremental ...
To simplify the definition of incremental type check-ers, our framework provides an abstract constraint-system component that captures the commonalities of different constraint systems, but abstracts from ...
doi:10.1145/2814270.2814277
dblp:conf/oopsla/ErdwegBKKM15
fatcat:o6yug7ceu5dxbfajjxwltdhdzm
A co-contextual formulation of type rules and its application to incremental type checking
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This way, the typing context coordinates type checking in otherwise independent subexpressions, which inhibits parallelization and incrementalization of type checking. ...
We describe a method for systematically constructing a co-contextual formulation of type rules from a regular context-based formulation and we show how co-contextual type rules give rise to incremental ...
To simplify the definition of incremental type check-ers, our framework provides an abstract constraint-system component that captures the commonalities of different constraint systems, but abstracts from ...
doi:10.1145/2858965.2814277
fatcat:qr75y2tcj5gy5hq7utgqleqohe
A decomposition approach for SMT-based schedule synthesis for time-triggered networks
2015
2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also present an implementation of a dependency tree on top of the decomposition approach to address applicationimposed constraints between frames. ...
This paper presents a decomposition approach that will allow us to improve to synthesize schedules with up to two orders of magnitude in terms of the number of constraints that can be handled. ...
Differences are due to tight constraints that are not ordered inside the subset of frames, which are solved with the incremental approach, and are highly dependent of their assertion sequence into the ...
doi:10.1109/etfa.2015.7301436
dblp:conf/etfa/PozoSRH15
fatcat:oneugy56pnfdhmvenzyljsh54e
Equal Incremental Fuel Cost Approach for Multi Area Operation of Power System
2017
Iraqi Journal for Electrical And Electronic Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper presents a novel approach, Equal Incremental fuel cost (λ-Concept) approach, for solving Multi Area Economic Dispatch (MAED) problem. ...
It is a simple approach and developed from the basic observation of incremental fuel cost of an area. ...
The significant features of the algorithm include: Incremental fuel cost (λ) concept is developed based on a simple observation from the equal incremental fuel costs of areas. Tie line constraints ...
doi:10.37917/ijeee.13.1.2
fatcat:hk3vcieqirh2vcp6h5v5wuyyge
Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The eplex library of the ECL i PS e Constraint Logic Programming platform allows the integration of Mathematical Programming techniques with its native Constraint Logic Programming techniques within the ...
It provides an interface to state-of-the-art Mathematical Programming solvers, and a set of programming primitives that allow 'hybrid' techniques to be easily expressed. ...
Finally, we would like to thank Dash Optimization, for their help and support with our use of the Xpress MP solver. ...
doi:10.1007/11564751_46
fatcat:cihsg3zlvvesrp7kxhqmbi7og4
Composition in Hierarchical CLP
1995
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We propose a variant of the Hierarchical Constraint Logic Programming (HCLP) scheme of Borning, Wilson, and others. ...
We consider compositionality and incrementality in Constraint Logic Programming, introduce HCLP, and present Wilson's proof that it is noncompositional. ...
If a system is not incremental, then adding one more constraint to the solution of, say, 20 constraints, involves as much work as solving the system of 21 constraints from scratch. ...
dblp:conf/ijcai/JampelH95
fatcat:f3mb7ljvjrel7gpu7ycgyvfsgq
Incremental Refinement Checking for Test Case Generation
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We extend our previous work by two techniques to improve efficiency: (1) a strategy to efficiently handle a large number of mutants and (2) incremental solving. ...
Action systems serve as formal models. They are wellsuited to model reactive systems and allow non-determinism. ...
Research herein was funded by the Austrian Research Promotion Agency (FFG), program line "Trust in IT Systems", project number 829583, TRUst via Failed FALsification of Complex Dependable Systems Using ...
doi:10.1007/978-3-642-38916-0_1
fatcat:g55cieic5jahhgjki5ebcoxftm
Distributed Algorithm for Incrementally Solving the Decoupled Multi-agent Simple Temporal Problem
2016
Journal of clean energy technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study a distributed scheduling algorithm for incrementally solving a DMaSTP. ...
In this area, Decoupled Multi-agent simple temporal problem (DMaSTP) is suitably applied for planning of a multi-agents system. ...
The problem is solved by separating into different types of adding constraints: adding local constraints and adding inter-agent constraints . ...
doi:10.7763/ijcte.2016.v8.1092
fatcat:5sm3gvv6tbcttdrqglh45ois3u
Design Methodology and Run-Time Management for Predictable Many-Core Systems
2015
2015 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Particularly, when applications with real-time requirements are executed, these constraints may become a problem. ...
This paper gives an overview of a design flow for hybrid application mapping for predictable many-core systems. ...
ACKNOWLEDGMENT This work was supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center "Invasive Computing" (SFB/TR 89). ...
doi:10.1109/isorcw.2015.48
dblp:conf/isorc/WildermannWT15
fatcat:hi44pj3amvcj5nok33gzj4mofe
A Comparative Study of Incremental Constraint Solving Approaches in Symbolic Execution
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Constraint solving is a major source of cost in Symbolic Execution (SE). This paper presents a study to assess the importance of some sensible options for solving constraints in SE. ...
Results suggest that tools should take advantage of incremental solving support from modern SMT solvers and researchers should look for ways to combine stack-and cache-based approaches to reduce execution ...
DFG is the German Research Foundation and FACEPE is the state of Pernambuco, Brazil, Research Foundation. ...
doi:10.1007/978-3-319-13338-6_21
fatcat:hs3fvyknkjgtlbbh6ipuvsrp34
Efficient Incremental Modelling and Solving
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The contribution of this work is to enable a native interaction between SAT solvers and the automated modelling system Savile Row to support efficient incremental modelling and solving. ...
A standard approach to solving AI planning problems, for example, is to incrementally extend the planning horizon and solve the problem of trying to find a plan of a particular length. ...
Incremental modelling and solving is a process of constructing an initial low level instance and obtaining further instances in a sequence by modelling and encoding just the differences between the previous ...
arXiv:2009.11111v1
fatcat:mfysayl7znhvxjwzuygjrrbgjm
« Previous
Showing results 1 — 15 out of 242,294 results