Filters








3,977 Hits in 3.7 sec

An adaptive prefix-assignment technique for symmetry reduction [article]

Tommi Junttila, Jukka Kohonen
2018 arXiv   pre-print
This paper presents a technique for symmetry reduction that adaptively assigns a prefix of variables in a system of constraints so that the generated prefix-assignments are pairwise nonisomorphic under  ...  Among key features of the technique are (i) adaptability---the prefix sequence can be user-prescribed and truncated for compatibility with the group of symmetries; (ii) parallelizability---prefix-assignments  ...  We thank Tomi Janhunen and Bart Bogaerts for useful discussions. A preliminary conference abstract of this paper appeared in Junttila T., Karppa M., Kaski  ... 
arXiv:1706.08325v2 fatcat:7ymscoewdrgdjbhx6yyjm6rziu

An Adaptive Prefix-Assignment Technique for Symmetry Reduction [chapter]

Tommi Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen
2017 Lecture Notes in Computer Science  
This paper presents a technique for symmetry reduction that adaptively assigns a prefix of variables in a system of constraints so that the generated prefix-assignments are pairwise nonisomorphic under  ...  Among key features of the technique are (i) adaptability-the prefix sequence can be user-prescribed and truncated for compatibility with the group of symmetries; (ii) parallelisability-prefix-assignments  ...  We thank Tomi Janhunen for useful discussions.  ... 
doi:10.1007/978-3-319-66263-3_7 fatcat:eoxyvqrldrhk7blva45vvou57u

Learning register automata: from languages to program structures

Malte Isberner, Falk Howar, Bernhard Steffen
2013 Machine Learning  
This paper reviews the development of Register Automaton learning, an enhancement of active automata learning to deal with infinite-state systems.  ...  We will revisit the precursor techniques and influences, which in total span over more than a decade.  ...  AAR and symmetry reduction For the previous approaches, we presented symmetry reduction as a means of reducing the amount of membership queries required.  ... 
doi:10.1007/s10994-013-5419-7 fatcat:wz3atcp7vjcf7irzgejh45a2li

Symmetries and Dualities in Name-Passing Process Calculi [chapter]

Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi
2014 Lecture Notes in Computer Science  
We study symmetries and duality between input and output in the π-calculus.  ...  The reduction semantics for πP that we have presented ma considered eager, in that arcs may freely act on prefixes.  ...  Typing judgements are of the form Γ P (process P respects the type assignments in Γ ), and Γ a : T (name a can be assigned type T in Γ ). 3 The following are the standard typing rules for parallel composition  ... 
doi:10.1007/978-3-319-13350-8_23 fatcat:ll4fhmjedncrhld2j4p6occuzi

Qute in the QBF Evaluation 2018

Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider, Martina Seidl, Luca Pulina
2019 Journal on Satisfiability, Boolean Modeling and Computation  
Its main distinguishing feature is dependency learning, a lazy technique for relaxing restrictions on the order of variable assignments imposed by nested quantifiers.  ...  Qute is a solver for Quantified Boolean Formulas (QBFs) based on Quantified Conflict-Driven Constraint Learning (QCDCL).  ...  That is, the solver chooses an unassigned variable x such that every variable y where Q y precedes Qx in the quantifier prefix and Q = Q has already been assigned.  ... 
doi:10.3233/sat190124 fatcat:nmrf5wkuwfheljqzwbceu4uc6q

Domain-Specific Optimization in Automata Learning [chapter]

Hardi Hungar, Oliver Niese, Bernhard Steffen
2003 Lecture Notes in Computer Science  
Automatically generated models may provide the key towards controlling the evolution of complex systems, form the basis for test generation and may be applied as monitors for running applications.  ...  From a conceptual point of view, the developments can be seen as an instance of optimizing general learning procedures by capitalizing on specific application profiles.  ...  Acknowledgement We thank Tiziana Margaria for fruitful discussions, as well as the anonymous referees for many helpful comments on early versions of this paper.  ... 
doi:10.1007/978-3-540-45069-6_31 fatcat:o53xeniwzbavjeo4lo3r5vecme

Symmetry Breaking in Quantified Boolean Formulae

Gilles Audemard, Saïd Jabbour, Lakhdar Sais
2007 International Joint Conference on Artificial Intelligence  
Extending such symmetry breaking techniques to quantified boolean formulae (QBF) is a very challenging task. In this paper, an approach to break symmetries in quantified boolean formulae is proposed.  ...  It makes an original use of universally quantified auxiliary variables to generate new symmetry breaking predicates and a new ordering of the QBF prefix is then computed leading to a new equivalent QBF  ...  Indeed, such symmetries does not lead to a great reduction in IJCAI-07 the search tree, since their corresponding variables are assigned last i.e. the formula is considerably reduced by the previous assignments  ... 
dblp:conf/ijcai/AudemardJS07 fatcat:yuzbwzqmmbhwzgk33cbuhzqnzi

Using Design Metrics for Predicting System Flexibility [chapter]

Robby, Scott A. DeLoach, Valeriy A. Kolesnikov
2006 Lecture Notes in Computer Science  
In this paper, we propose metrics for determining system flexibility at design time.  ...  Giving agents the autonomy to adapt and then expecting them to adapt only in acceptable ways requires rigorous design analyses.  ...  Thus, we believe that we can apply symmetry reduction on agent instances based on their type (i.e., they are indistinguishable at the design level) along with the partial order reduction technique hinted  ... 
doi:10.1007/11693017_15 fatcat:vnaq6f566vcsrcecm5ko4lkvca

Simple, Fast, and Efficient Natural Language Adaptive Compression [chapter]

Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, José R. Paramá
2004 Lecture Notes in Computer Science  
Then, we show how End-Tagged Dense Code, an alternative to word-based Huffman, can be turned into a faster and much simpler adaptive compression method which obtains almost the same compression ratios.  ...  A one-pass adaptive variant of Huffman exists, but it is character-oriented and rather complex.  ...  Huffman algorithm obtains an optimal (shortest total length) prefix code for a given text. A code is a prefix code if no codeword is a prefix of any other codeword.  ... 
doi:10.1007/978-3-540-30213-1_34 fatcat:6zyp5soayjcglf7b6nr7jjquvq

Dependency Learning for QBF

Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
2019 The Journal of Artificial Intelligence Research  
By default, QCDCL assigns variables in the order of their appearance in the quantifier prefix so as to account for dependencies among variables.  ...  We introduce dependency learning, a new technique for exploiting variable independence within QCDCL that allows solvers to learn variable dependencies on the fly.  ...  Acknowledgments We want to thank Florian Lonsing for helpful discussions related to QCDCL and the reviewers for their thoughtful comments on our manuscript.  ... 
doi:10.1613/jair.1.11529 fatcat:hl6bflqgxng3bha3agwcm6lyia

On the Virtue of Patience: Minimizing Büchi Automata [chapter]

Rüdiger Ehlers, Bernd Finkbeiner
2010 Lecture Notes in Computer Science  
We propose a new technique that achieves significant further reductions when more time can be invested in the minimization of the automaton.  ...  A difficult design decision in such constructions is to trade time spent on minimizing the Büchi automaton versus time spent on model checking against an unnecessarily large automaton.  ...  Acknowledgements The authors want to thank Alexandre Duret-Lutz from the spot team for the support with the specifications and the converter.  ... 
doi:10.1007/978-3-642-16164-3_10 fatcat:dybxr5mpgvedxkplctm4xcamoe

Towards Practical Infinite Stream Constraint Programming: Applications and Implementation [chapter]

Jasper C. H. Lee, Jimmy H. M. Lee
2014 Lecture Notes in Computer Science  
As a novel application, we demonstrate how St-CSPs can model mathematically and generate a PID controller for driving a self-balancing tray and an inverted pendulum in real-time.  ...  We give two St-CSP examples that can benefit from our new implementation techniques.  ...  We thank Simon Wong for building the self-balancing tray and inverted pendulum used for our demonstrations, and Kin-Hong Wong for his help with PID control and robotics.  ... 
doi:10.1007/978-3-319-10428-7_34 fatcat:5pskkqrs65dsrarnbbs6ojjfy4

Monitoring hyperproperties

Bernd Finkbeiner, Christopher Hahn, Marvin Stenger, Leander Tentrup
2019 Formal methods in system design  
For the sequential models, we present a technique that minimizes the number of traces that need to be stored.  ...  By recognizing properties of specifications such as reflexivity, symmetry, and transitivity, we reduce the number of comparisons between traces.  ...  We give the adapted definition of monitorability and a characterization for alternation-free HyperLTL.  ... 
doi:10.1007/s10703-019-00334-z pmid:31806925 pmcid:PMC6853877 fatcat:7fvhftlkdbcyzgnlknjx4n5ouq

Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System [chapter]

Barbara König
2000 Lecture Notes in Computer Science  
We introduce a generic type system for the synchronous polyadic π -calculus, allowing us to mechanise the analysis of input/output capabilities of mobile processes.  ...  Acknowledgements I would like to thank the anonymous referees for their detailed and extremely helpful comments.  ...  in an input or output prefix at any given point in any reduction sequence.  ... 
doi:10.1007/3-540-45022-x_34 fatcat:kgobuvrltjdhrng2vjxlr63ndi

Analysing input/output-capabilities of mobile processes with a generic type system

Barbara König
2005 The Journal of Logic and Algebraic Programming  
We introduce a generic type system for the synchronous polyadic π -calculus, allowing us to mechanise the analysis of input/output capabilities of mobile processes.  ...  Acknowledgements I would like to thank the anonymous referees for their detailed and extremely helpful comments.  ...  in an input or output prefix at any given point in any reduction sequence.  ... 
doi:10.1016/j.jlap.2004.01.004 fatcat:5naijurrfzdkxlls2efswqphi4
« Previous Showing results 1 — 15 out of 3,977 results