195 Hits in 3.7 sec

Logic-Based Solution Methods for Optimal Control of Hybrid Systems

A. Bemporad, N. Giorgetti
2006 IEEE Transactions on Automatic Control  
We propose a suitable model of the hybrid dynamics and a class of optimal control problems that embrace both symbolic and continuous variables/functions, and that are tailored to the use of the new hybrid  ...  Although this operation can be done automatically, most of the original symbolic structure of the problem (e.g., transition functions of finite state machines, logic constraints, symbolic variables, etc  ...  Automaton The discrete dynamics of a hybrid system is modeled as an automaton (or finite state machine).  ... 
doi:10.1109/tac.2006.876949 fatcat:5s63fkonfncizlvmylystmrx5e

Decentralized Constraint Satisfaction

Ken R. Duffy, Charles Bordenave, Douglas J. Leith
2013 IEEE/ACM Transactions on Networking  
We introduce a stochastic decentralized CSP solver and prove that it will find a solution in almost surely finite time, should one exist, also showing it has many practically desirable properties.  ...  We term these algorithms decentralized CSP solvers. The best known CSP solvers were designed for centralized problems and do not meet these criteria.  ...  We use b = 0.2 for random 3-SAT, b = 0.1 for random 4-SAT and b = 0.05 for random 5-SAT.  ... 
doi:10.1109/tnet.2012.2222923 fatcat:qqokeipq5zdlpjjq3dab4wh3ce

An Extended ACL for Solving Authorization Conflicts

Chisong Li, Zhensong Liao
2009 2009 Second International Symposium on Electronic Commerce and Security  
We evaluate CoCo's compositionality and model complexity simplification while using a set of motivating decision scenarios.  ...  Software Product Line Engineering has introduced feature modeling as a domain analysis technique used to represent the variability of software products and decision-making scenarios.  ...  Acknowledgments The authors would like to thank Jaime Chavarriaga, Kelly Garcés, and Juliana Alves Pereira for their useful feedback.  ... 
doi:10.1109/isecs.2009.164 fatcat:5zdmoraulrd53bkatqc4srngpq

An efficient constraint based framework forhandling floating point SMT problems [article]

Heytem Zitoun, Claude Michel, Laurent Michel, Michel Rueher
2020 arXiv   pre-print
This decomposition and encoding processes lead to the obfuscation of the high-level constraints and a loss of information on the structure of the combinatorial model.  ...  SAT encoding would be cumbersome or ineffective.  ...  State of the Art Satisfiability Modulo Theories (SMT). SMT solvers are widely used in program verification. They had great success especially in bounded model checking of integer programs.  ... 
arXiv:2002.12441v1 fatcat:adfddhkp5reqnl4uutmgbm73ve

Software model synthesis using satisfiability solvers

Marijn J. H. Heule, Sicco Verwer
2012 Empirical Software Engineering  
We propose -when EDSM becomes too weak -to tackle the reduced identification problem using satisfiability solvers.  ...  We introduce a novel approach for synthesis of software models based on identifying deterministic finite state automata. Our approach consists of three important contributions.  ...  state-of-the-art in DFA identification A deterministic finite state automaton (DFA) is one of the basic and most commonly used finite state machines.  ... 
doi:10.1007/s10664-012-9222-z fatcat:s6qepw7ieff4pit3gokfjrnbfa

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  
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.  ...  PaP2 encodes action successions in the finite state automata (FSA) as table constraints with cells containing sets of values. PaP2 uses SICStus Prolog as its constraint solver.  ...  In our model, we directly encode the DTGs of the problem into table constraints and use a general-purpose CSP solver to solve the corresponding constraint satisfaction problem.  ... 
doi:10.1613/jair.5378 fatcat:yctcm55tkngbtdkqgomo5idwau

Connections and Integration with SAT Solvers: A Survey and a Case Study in Computational Biology [chapter]

Fabien Corblin, Lucas Bordeaux, Eric Fanchon, Youssef Hamadi, Laurent Trilling
2010 Hybrid Optimization  
The resolution of these constraints has been the subject of intense and successful work during the past decade, and SAT solvers have reached a spectacular maturity.  ...  As a case study that illustrates the use of SAT and CP we consider an application in computational biology: the task to build gene regulatory networks (GRNs).  ...  finite domain solvers.  ... 
doi:10.1007/978-1-4419-1644-0_13 fatcat:qrvwyo7wmvapxetsppwqldbxoe

Computational protein design as an optimization problem

David Allouche, Isabelle André, Sophie Barbe, Jessica Davies, Simon de Givry, George Katsirelos, Barry O'Sullivan, Steve Prestwich, Thomas Schiex, Seydou Traoré
2014 Artificial Intelligence  
The CPD problem is a specific form of binary Cost Function Network (CFN, aka Weighted CSP).  ...  We compare toulbar2 with these different approaches using a variety of solvers. We observe tremendous differences in the difficulty that each approach has on these instances.  ...  We would like to thank Damien Leroux for his help in the generation of encodings using Python.  ... 
doi:10.1016/j.artint.2014.03.005 fatcat:k7o7nvjc4bbkbk6d4qojshbztu

Composable communication constraint-based control

Mong-ying A. Hsieh, Pranav Srivastava, Vijay Kumar, Camillo J. Taylor, Douglas W. Gage
2004 Mobile Robots XVII  
We develop a constraint-based model for cost-optimal planning that uses global constraints to improve the inference in planning.  ...  Constraint-based approaches provide a useful complement to heuristic search optimal planners.  ...  Acknowledgements We would like to thank Roman Bartak and Daniel Toropila for allowing us to use their planner SeP in our evaluation.  ... 
doi:10.1117/12.571960 dblp:conf/mr/HsiehS0T02 fatcat:zlcsz6sujje5hgflaq6mi2gi2q

Recent Advances in AI Planning

Daniel S. Weld
1999 The AI Magazine  
normal form formulas for solution using systematic or stochastic SAT methods.  ...  In this survey, I explain the latest techniques and suggest areas for future research.  ...  MDP and POMDP researchers typically state the agent's objective in terms of maximizing a utility function over a fixed, finite horizon.  ... 
doi:10.1609/aimag.v20i2.1459 dblp:journals/aim/Weld99 fatcat:wdc3oslle5h4dlvzwhp65ku6va

Automated Multi-Level Dynamic System Topology Design Synthesis

Aart-Jan Kort, Jan Wijkniet, Alexander Serebrenik, Theo Hofman
2020 Vehicles  
Using state-of-the-art computational design synthesis techniques assures that the complete search space, given a finite set of system elements, is processed to find all feasible topologies.  ...  The increasing computational power allows us to generate automatically novel and new mechatronic discrete-topology concepts in an efficient manner.  ...  Step 1: Creation of a Library: Identification of Useful Components First, a library of components and a finite number of input and output ports for each of these components are defined and specified by  ... 
doi:10.3390/vehicles2040035 fatcat:uviqmo3xqvbgjaa4i36kc4xaeq

SCIP: solving constraint integer programs

Tobias Achterberg
2009 Mathematical Programming Computation  
Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and solving techniques.  ...  In this paper we discuss the software framework and solver SCIP (Solving Constraint Integer Programs), which is free for academic and non-commercial use and can be downloaded in source code.  ...  particular, I thank Timo Berthold, Gerald Gamrath, Stefan Heinz, Bo Jensen, Thorsten Koch, Manuel Kutschka, Alexander Martin, Michael Perregaard, Marc Pfetsch, Christian Raack, Robert Waniek, Michael Winkler, and  ... 
doi:10.1007/s12532-008-0001-1 fatcat:elsjugcawndjvlt2lf3e5vgtbq

Software Architecture of Modern Model Checkers [chapter]

Fabrice Kordon, Michael Leuschel, Jaco van de Pol, Yann Thierry-Mieg
2019 Lecture Notes in Computer Science  
Automated formal verification using model checking is a mature field with many tools available. We summarize the recent trends in the design and architecture of model checking tools.  ...  An important design goal of modern model checkers is to support many input languages (front-end) and many verification strategies (back-end), and to allow arbitrary combinations of them.  ...  We also thank Stefan Blom, Michael Weber, Elwin Pater for setting up the architecture of LTSmin and Alfons Laarman, Tom van Dijk, Jeroen Meijer for recent developments on multicore and symbolic LTSmin.  ... 
doi:10.1007/978-3-319-91908-9_20 fatcat:seh3tr6qdrf2lovprttf5msm2m

An introduction to mechanized reasoning

Manfred Kerber, Christoph Lange, Colin Rowat
2016 Journal of Mathematical Economics  
Mechanized reasoning uses computers to verify proofs and to help discover new theorems.  ...  First, we introduce mechanized reasoning in general, describing both the techniques and their successful applications.  ...  desired properties, e.g. by using SAT solvers.  ... 
doi:10.1016/j.jmateco.2016.06.005 fatcat:out6y5pgjrcrhc4yq4lk55yrhy

All or nothing: toward a promise problem dichotomy for constraint problems [article]

Lucy Ham, Marcel Jackson
2017 arXiv   pre-print
A finite constraint language R is a finite set of relations over some finite domain A.  ...  We show that intractability of the constraint satisfaction problem CSP(R) can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise  ...  In particular, this is true when |D| ≤ 3k, but we will also use the more general fact below, and state it for later reference. Claim.  ... 
arXiv:1611.00886v3 fatcat:p2z7sjjmgzdyrgzt7xmtl2sdne
« Previous Showing results 1 — 15 out of 195 results