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
Using Redundant Constraints for Refinement
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
In this paper we address the problem of refining the reachable set approximation by adding redundant constraints which allow bounding the reachable sets in some critical directions. ...
This implementation allowed us to treat systems of much higher dimensions. We finally report some experimental results showing the performance of the refinement algorithm. ...
We then present two methods for refining approximations by using redundant constraints. ...
doi:10.1007/978-3-642-15643-4_5
fatcat:o6eezrxxybhbln472gf7gcmcr4
The 3 R's of optimizing constraint logic programs
1993
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
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 2019; you can also visit the original URL.
The file type is application/pdf.
We present a methodology for use in the compilation of CLP languages which is designed to reduce the overhead of the global constraint solver. This methodology is based on three optimizations. ...
The second, removal, involves eliminating constraints from the solver when they are redundant. ...
Omb : p Lin -+ LComb is defined bỹ LComb @ = (( QCHU1l~), (~LSign @)).a
Refinement Refinement requires us to find primitive constraints which are redundant with respect to the answers of a state. ...
doi:10.1145/158511.158685
dblp:conf/popl/MarriottS93
fatcat:ndaumcgvhvdidnymi5lgc6567m
Optimizing bottom-up evaluation of constraint queries
1996
The Journal of Logic Programming
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 show how to optimize the bottom-up evaluation of queries for such programs using transformations based on analysis obtained using abstract interpretation. ...
Although the paper concentrates on a class of efficiently executable programs, the optimizations we describe are correct and applicable for arbitrary constraint logic programs. ...
Further analysis is then used to determine what constraints are redundant and can be removed. We study two types of refinement. ...
doi:10.1016/0743-1066(95)00050-x
fatcat:ybkby5sxqngrvimzmprnfjqopq
On Avoiding Redundancy in Inductive Logic Programming
[chapter]
2004
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.
Experimental results show that the number of hypotheses generated and execution time are reduced when expert knowledge is used to avoid redundancy. ...
The generation of redundant hypotheses may prevent the systems from finding good models and increases the time to induce them. ...
We thank the anonymous reviewers for their useful comments. ...
doi:10.1007/978-3-540-30109-7_13
fatcat:5nqimiv3m5efbb5o7rgxczgr24
Constraint capture and maintenance in engineering design
2008
Artificial intelligence for engineering design, analysis and manufacturing
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.
Support for the maintenance of constraints includes detecting inconsistencies, subsumption, redundancy, fusion between constraints and suggesting appropriate refinements. ...
) together with the corresponding constraints and the domain ontology can be used by a machine to support maintenance of constraints. ...
Also, Colan is mainly used in ConEditor+ as a declarative language for expressing constraints and not used for constraint programming. ...
doi:10.1017/s089006040800022x
fatcat:ynjyrmd7gnbfbipzjzhkttwhnm
Conflict Resolution
[chapter]
2009
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 2019; you can also visit the original URL.
The file type is application/pdf.
The method successively refines an initial assignment with the help of newly derived constraints until either the assignment becomes a solution of the system or a trivially unsatisfiable constraint is ...
We introduce a new method for solving systems of linear inequalities over the rationals-the conflict resolution method. ...
To explain the rationale behind this strategy let us extend our notion of redundancy to constraints. We call a constraint c at a level k redundant if this constraint is implied by S <k+1 − {c}. ...
doi:10.1007/978-3-642-04244-7_41
fatcat:zowplb5j6vcqtnp55fop6cg4ua
Partition Refinement for Bisimilarity in CCP
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Saraswat's concurrent constraint programming (ccp) is a mature formalism for modeling processes (or programs) that interact by telling and asking constraints in a global medium, called the store. ...
In this paper, we propose a variation of the partition refinement algorithm for verifying ccp bisimilarity. ...
We shall assume that the constraint system is wellfounded and, for practical reasons, that its ⊑ is decidable. We now define the constraint system we use in our examples.
Example 1. ...
arXiv:1212.1548v1
fatcat:wdekt35az5a2jo2m4gkglif2v4
Partition refinement for bisimilarity in CCP
2012
Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12
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.
Saraswat's concurrent constraint programming (ccp) is a mature formalism for modeling processes (or programs) that interact by telling and asking constraints in a global medium, called the store. ...
In this paper, we propose a variation of the partition refinement algorithm for verifying ccp bisimilarity. ...
We shall assume that the constraint system is wellfounded and, for practical reasons, that its is decidable. We now define the constraint system we use in our examples. Example 1. ...
doi:10.1145/2245276.2245296
dblp:conf/sac/AristizabalBVP12
fatcat:4fopvqewfngezivflv7a2etevi
Dynamic Optimization Using Local Collocation Methods and Improved Multiresolution Technique
2018
Applied Sciences
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 2019; you can also visit the original URL.
The file type is application/pdf.
Additionally, the proposed technique involves a mesh refinement algorithm to remove the redundant mesh points in the constant control regions by analyzing the control slopes. ...
The proposed technique consists of local collocation methods and a multiresolution-based mesh refinement method. ...
Table 1 . 1 Mesh refinement results for the semi-batch reactor problem using different methods. ...
doi:10.3390/app8091680
fatcat:flng62z4c5hyzgzxc4awuu3f5i
BLISS: Improved Symbolic Execution by\\ Bounded Lazy Initialization with SAT Support
2015
IEEE Transactions on Software 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 2018; you can also visit the original URL.
The file type is application/pdf.
SPF combines symbolic execution with model checking and constraint solving, to systematically explore program paths for verification, as well as for automated test input generation by solving the path ...
Satisfiability checks on refined symbolic heaps allow us to prune these heaps as soon as it can be confirmed that they cannot be extended to any valid concrete heap. ...
SPF combines symbolic execution with model checking and constraint solving, to systematically explore program paths for verification, as well as for automated test input generation by solving the path ...
doi:10.1109/tse.2015.2389225
fatcat:6vyxbn74m5e2dpcjtd25dcdwfu
Constraints and restraints in crystal structure analysis
2009
Journal of Applied Crystallography
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 widely used restraint-based approach to structural analysis using diffraction data is critiqued. The convenience of using rigid constraints, through the use of internal coordinates, is discussed. ...
There are several good reasons for pursuing non-redundance. ...
Using restraints On the whole, constraints are used somewhat infrequently. ...
doi:10.1107/s0021889808044142
pmid:22477768
pmcid:PMC3246815
fatcat:3kh2f7ctnnduhfecsckiu3afou
Intelligent supporting techniques for the maintenance of constraint-based configuration systems
2015
International Configuration Workshop
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.
Previous research focused on the detection of conflicts, repair actions for the conflicts, and redundant constraints. ...
Nowadays, constraint-based configuration systems represent volatile product assortments: Variables must be adapted, new product features lead to new questions for the customer, and / or the constraints ...
For calculating all conflicts / diagnoses / redundant constraint sets, we use Reiter's HSDAG approach [12] . ...
dblp:conf/confws/ReinfrankNWF15
fatcat:pxjw7wverzarfi2pptbl6lfvfe
Parallel cartesian planning in dynamic environments using constrained trajectory planning
2015
2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids)
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 2015; you can also visit the original URL.
The file type is application/pdf.
We present a parallel Cartesian planning algorithm for redundant robot arms and manipulators. ...
At runtime, multiple paths in this roadmap are computed as initial trajectories for an optimization-based planner that tends to satisfy various constraints corresponding to demands on the trajectory, including ...
The trajectories are used as initial trajectories for the trajectory refinement step. Our planner optimizes the trajectories in the dynamic environment, using cost functions of the constraints. ...
doi:10.1109/humanoids.2015.7363489
dblp:conf/humanoids/ParkRSSZM15
fatcat:ujcotwekyvgyvdc2zojyx2udqu
Additivity, redundancy, and complementarity between structural information from NMR and SAXS data
2008
Acta Crystallographica Section A Foundations of Crystallography
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 2018; you can also visit the original URL.
The file type is application/pdf.
We previously developed a new algorithm that refines the protein structure by restrained molecular dynamics with SAXS constraints 1) . ...
At first we added SAXS constraints (h < 0.3 Å -1 ) into the original NMR-derived restraints for the calculation. The quality of the structure ensemble was significantly increased. ...
We previously developed a new algorithm that refines the protein structure by restrained molecular dynamics with SAXS constraints 1) . ...
doi:10.1107/s0108767308097079
fatcat:xfxyar2gmzhhtevaighh6vbski
Efficient computation of program equivalence for confluent concurrent constraint programming
2013
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP '13
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.
Concurrent Constraint Programming (ccp) is a well-established declarative framework from concurrency theory. ...
This fragment, which has been the subject of many theoretical studies, has strong ties to first-order logic and an elegant denotational semantics, and it can be used to model real-world situations. ...
Then we present the standard partition refinement algorithm, the concurrent constraint programming (ccp) and we show that partition refinement cannot be used for checking equivalence of concurrent constraint ...
doi:10.1145/2505879.2505902
dblp:conf/ppdp/PinoBV13
fatcat:b6nirdz4wfcx3d7znhmula42wq
« Previous
Showing results 1 — 15 out of 98,196 results