2,277 Hits in 4.3 sec

Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT [chapter]

Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale
2016 Lecture Notes in Computer Science  
Specifically, unit propagation on the encoding simulates generalised arc consistency on the original constraint. To create compact and efficient encodings we use the concept of short support.  ...  Short support has been successfully applied to create efficient propagation algorithms for arbitrary constraints.  ...  Acknowledgements We would like to thank the EPSRC for funding this work through grants EP/H004092/1, EP/K015745/1, and EP/M003728/1.  ... 
doi:10.1007/978-3-319-44953-1_1 fatcat:5fjsqqibanboxo73knfswyajya

Constraint Logic Programming [chapter]

Thom Frühwirth, Alexander Herold, Volker Küchenhoff, Thierry Provost, Pierre Lim, Eric Monfroy, Mark Wallace
1992 Lecture Notes in Computer Science  
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving.  ...  The most important advantage that these languages offer is the short development time while exhibiting an efficiency comparable to imperative languages.  ...  Acknowledgements The authors would like to thank the following people for the discussions they had with them and for their encouragement and support: Abder Aggoun, Nicolas Beldiceanu, Fran~oise Berthier  ... 
doi:10.1007/3-540-55930-2_2 fatcat:f3kflbw6szewpkpoqsfe2mfneu

In pursuit of the holy grail

E. Freuder
1996 ACM Computing Surveys  
Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling  ...  The central part of the paper is dedicated to the description of main constraint satisfaction techniques and industrial applications.  ...  A constraint graph is Kconsistent if for every system of values for K-1 variables satisfying all the constraints among these variables, there exits a value for arbitrary K-th variable such that the constraints  ... 
doi:10.1145/242224.242304 fatcat:uugoyii6vrd4jhabyqi3jw6qcu

Efficient Unfolding of Coloured Petri Nets Using Interval Decision Diagrams [chapter]

Martin Schwarick, Christian Rohr, Fei Liu, George Assaf, Jacek Chodak, Monika Heiner
2020 Lecture Notes in Computer Science  
We consider coloured Petri nets, qualitative and quantitative ones alike, as supported by our PetriNuts tool family, comprising, among others, Snoopy, Marcie and Spike.  ...  For this comparison we use the 22 scalable coloured models from the MCC benchmark suite, complemented by a few from our own collection.  ...  The unfolding time is short for smaller model versions, but quickly explodes for larger model versions; compare Fig. 7.  ... 
doi:10.1007/978-3-030-51831-8_16 fatcat:cffgfqipfrdvbflijto4cuxrsq

Encoding Domain Transitions for Constraint-Based Planning

Nina Ghanbari Ghooshchi, Majid Namazi, M.A.Hakim Newton, Abdul Sattar
2017 The Journal of Artificial Intelligence Research  
We describe a constraint-based automated planner named Transition Constraints for Parallel Planning (TCPP).  ...  TCPP uses Minion the constraint solver to solve the constraint model and returns a parallel plan. We empirically compare TCPP with the other state-of-the-art constraint-based parallel planner PaP2.  ...  A CSP is generalised arc-consistent if all of its constraints are generalised arc-consistent.  ... 
doi:10.1613/jair.5378 fatcat:yctcm55tkngbtdkqgomo5idwau

Short and Long Supports for Constraint Propagation

P. Nightingale, I. P. Gent, C. Jefferson, I. Miguel
2013 The Journal of Artificial Intelligence Research  
propagation algorithm for exploiting short supports.  ...  pair may still form part of an assignment that satisfies the constraint) for all other variables and values and save substantial work -- but short supports have not been studied in their own right.  ...  Acknowledgements We would like to thank anonymous reviewers of our previous papers on this topic for their comments, and EPSRC for funding this work through grants EP/H004092/1 and EP/E030394/1.  ... 
doi:10.1613/jair.3749 fatcat:oxsogjufofcf5a7o2jawndvmji

Generalized Support and Formal Development of Constraint Propagators [article]

James Caldwell and Ian P. Gent and Peter Nightingale
2016 arXiv   pre-print
Arc-consistency algorithms such as AC2001 make use of support in the form of a single domain value. GAC algorithms such as GAC-Schema use a tuple of values to support each literal.  ...  Specialised propagation algorithms (propagators) exist for many classes of constraints. The concept of support is pervasive in the design of propagators.  ...  Acknowledgements The work of the authors has been partially supported by the following UK EPSRC grants: EP/E030394/1, EP/F031114/1, EP/H004092/1, and EP/M003728/1, support for which we are very grateful  ... 
arXiv:1504.05846v2 fatcat:hk6lnwqvinewnf3ny2mlgcda4u

A Scalable graph-cut algorithm for N-D grids

Andrew Delong, Yuri Boykov
2008 2008 IEEE Conference on Computer Vision and Pattern Recognition  
To achieve these goals, we generalised the standard relabeling operations associated with push-relabel.  ...  We enhance the push-relabel algorithm for maximum flow [14] with two practical contributions. First, true global minima can now be computed on immense grid-like graphs too large for physical memory.  ...  We also thank Siemens Corporate Research, Daphne Yu in particular, for the abdomen dataset and for supporting our early research into parallel push-relabel.  ... 
doi:10.1109/cvpr.2008.4587464 dblp:conf/cvpr/DelongB08 fatcat:v23msbkog5ecvfgtpjahbzgjzu

Superstring Graph: A New Approach for Genome Assembly [chapter]

Bastien Cazaux, Gustavo Sacomoto, Eric Rivals
2016 Lecture Notes in Computer Science  
Overlap graph based algorithms were used with the first generation of sequencers, while de Bruijn graph (DBG) based methods were preferred for the second generation.  ...  Genome assembly remains a major bottleneck in bioinformatics: indeed, high throughput sequencing apparatus yield millions of short sequencing reads that need to be merged based on their overlaps.  ...  We thank the reviewers for their comments and suggestions.  ... 
doi:10.1007/978-3-319-41168-2_4 fatcat:cns7emg7tvcuvmeptkn746jlye

Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions

Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
This allows us to extend a state of the art subgraph isomorphism enumeration solver with proof logging support, so that the solutions it outputs may be audited and verified for correctness and completeness  ...  Some experiments used resources provided by the Swedish National Infrastructure for Computing (SNIC) at the High Performance Computing Center North (HPC2N) at Umeå University.  ...  Ciaran McCreesh was supported by the Engineering and Physical Sciences Research Council [grant number EP/P026842/1].  ... 
doi:10.24963/ijcai.2020/158 dblp:conf/ijcai/GochtMN20 fatcat:yfryglyzobawrb5pdchzo7kbgq

A Review of Literature on Parallel Constraint Solving [article]

Ian P. Gent and Ciaran McCreesh and Ian Miguel and Neil C.A. Moore and Peter Nightingale and Patrick Prosser and Chris Unsworth
2018 arXiv   pre-print
As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it.  ...  Yet there seems to be little overall guidance that can be given on how best to exploit multicore computers to speed up constraint solving.  ...  Acknowledgements We thank Christopher Jefferson for a number of useful discussions. We thank reviewers of this journal for their suggestions which greatly improved this paper.  ... 
arXiv:1803.10981v1 fatcat:ramac3tqfrephdxq7gca3tglei

Spatiotemporal state lattices for fast trajectory planning in dynamic on-road driving scenarios

Julius Ziegler, Christoph Stiller
2009 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems  
They are second order continuous, obey nonholonomic constraints and are optimised for minimum square of jerk. Planning time remains below 20 ms on general purpose hardware.  ...  We present a method for motion planning in the presence of moving obstacles that is aimed at dynamic on-road driving scenarios.  ...  ACKNOWLEDGEMENTS We gratefully acknowledge support of this work by the German Research Foundation (DFG) within the transregional collaborative research centre 28 "Cognitive Automobiles".  ... 
doi:10.1109/iros.2009.5354448 dblp:conf/iros/ZieglerS09 fatcat:ifj2akzhmbbkth4wv3lcda7gbu

Optimal Implementation of Watched Literals and More General Techniques

I. P. Gent
2013 The Journal of Artificial Intelligence Research  
I prove that an implementation technique for scanning lists in backtracking search algorithms is optimal.  ...  The result applies to a simple general framework, which I present: applications include watched literal unit propagation in SAT and a number of examples in constraint satisfaction.  ...  I thank authors of MiniSat, tinisat, and JQuest for making their code available for study. Appendix A. Experiments in MiniSat  ... 
doi:10.1613/jair.4016 fatcat:wnq2vlr3vne6bby4iycvflafmq

Generalised control-oriented modelling framework for multi-energy systems

Sebastian Long, Ognjen Marjanovic, Alessandra Parisio
2019 Applied Energy  
This paper presents a novel generalised modelling framework for multi-energy systems that is particularly well suited, though not limited to, predictive control applications.  ...  and environmental constraints.  ...  For these cases E n,i = E n,i = E n,i and (10) collapses to an equality constraint.  ... 
doi:10.1016/j.apenergy.2018.10.074 fatcat:h66rsrrwkfa3jo7exxe77pjfoq

Automatic fine motor control behaviours for autonomous mobile agents operating on uneven terrains

Jaime Valls Miro, Gamini Dissanayake
2010 Proceedings of the 3rd International Symposium on Practical Cognitive Agents and Robots - PCAR '10  
A novel mechanism able to produce increasingly stable paths for mobile robotic agents travelling over uneven terrain is proposed in this paper.  ...  This is particularly relevant for kinematically reconfigurable platforms which significantly modify their mass distribution through posture adaptation, such as humanoids or mobile robots equipped with  ...  On the other hand, the proposed methodology is able to exploit robot reconfigurations along the geodesic path in a generalised way to confidently derive stable paths.  ... 
doi:10.1145/1967112.1967117 fatcat:h6ep7tgf45ak5jf3xgpvizglxu
« Previous Showing results 1 — 15 out of 2,277 results