1,365 Hits in 4.9 sec

Computation of the Transient in Max-Plus Linear Systems via SMT-Solving [article]

Alessandro Abate, Alessandro Cimatti, Andrea Micheli, Muhammad Syifa'ul Mufid
2020 arXiv   pre-print
This paper proposes a new approach, grounded in Satisfiability Modulo Theories (SMT), to study the transient of a Max-Plus Linear (MPL) system, that is the number of steps leading to its periodic regime  ...  Our experiments show that the proposed technique dramatically outperforms state-of-the-art methods based on max-plus algebra computations for systems of large dimensions.  ...  Introduction Max-Plus Linear (MPL) systems are a class of discrete-event systems (DES) that are based on the max-plus algebra, an algebraic system using the two operations of maximisation and addition.  ... 
arXiv:2007.00505v2 fatcat:xf5pksocqrdfpmjqfbotzswrwm

Symbolic Reachability Analysis of High Dimensional Max-Plus Linear Systems [article]

Muhammad Syifa'ul Mufid, Dieky Adzkiya, Alessandro Abate
2020 arXiv   pre-print
This work discusses the reachability analysis (RA) of Max-Plus Linear (MPL) systems, a class of continuous-space, discrete-event models defined over the max-plus algebra.  ...  The performance and scalability of the developed SMT-based algorithms are shown to clearly outperform state-of-the-art RA algorithms for MPL systems, newly allowing to investigate RA of high-dimensional  ...  ACKNOWLEDGEMENTS The authors are grateful to Alessandro Cimatti, Andrea Micheli and Mirco Giacobbe for useful comments on SMT.  ... 
arXiv:2007.04510v1 fatcat:zlk22z2bevehlkssq47lawclte

An SMT-Based Solver for Continuous t-norm Based Logics [chapter]

Amanda Vidal, Félix Bou, Lluís Godo
2012 Lecture Notes in Computer Science  
In this paper, extending a recent approach by Ansótegui et al., we present ongoing work on an efficient and modular SMT-based solver for a wide family of continuous t-norm based fuzzy logics.  ...  In the literature, little attention has been paid to the development of solvers for systems of mathematical fuzzy logic, even though there is an important number of studies on complexity and proof theory  ...  The authors acknowledge support of the Spanish projects TASSAT  ... 
doi:10.1007/978-3-642-33362-0_53 fatcat:meojcw3wmrcfjin2ejeusru5y4

Satisfiability Modulo the Theory of Costs: Foundations and Applications [chapter]

Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani, Cristian Stenico
2010 Lecture Notes in Computer Science  
We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and multiple cost functions, e.g.,  ...  First, we tackle the problem of Optimization Modulo Theories: rather than checking the existence of a satisfying assignment, as in SMT, we require a satisfying assignment that minimizes a given cost function  ...  Using SMT(T ∪ C), we addressing BOMT(T ) with two approaches, one based on linear-search/branch&bound, and the other based on binary-search. A Linear search/branch&bound approach.  ... 
doi:10.1007/978-3-642-12002-2_8 fatcat:u45bnalt2vc6ja7kzbkfpqlk64

Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions

Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani
2018 ACM Transactions on Computational Logic  
the problem of analyzing the reachability for transition systems represented in terms of SMT formulae.  ...  The method has been implemented in the MathSAT SMT solver and in the nuXmv model checker.  ...  The verification engines of nuXmv have been extended to deal with invariant checking based on Bounded Model Checking, k-induction, and incremental linearization over IC3.  ... 
doi:10.1145/3230639 fatcat:ucgtgfpdwbemrca2wmtwepm7pa

Integrating SMT with Theorem Proving for Analog/Mixed-Signal Circuit Verification [chapter]

Yan Peng, Mark Greenstreet
2015 Lecture Notes in Computer Science  
We present our integration of the Z3 SMT solver into the ACL2 theorem prover and its application to formal verification of analog-mixed signal circuits by proving global convergence for a state-of-the-art  ...  The PLL is an example of a second-order hybrid control system; its verification demonstrates how these methods can address challenges that arise when verifying such designs.  ...  The proof is based on a simple ranking function that Z3 easily verifies. By proving this we've shown that the non-linearities of the global model do not create unintended stable modes.  ... 
doi:10.1007/978-3-319-17524-9_22 fatcat:qp5dgklxmzb2ln3hnfmhmsb5ze

Bag-of-Words Forced Decoding for Cross-Lingual Information Retrieval

Felix Hieber, Stefan Riezler
2015 Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies  
The SMT model is extended by retrieval-specific features that are optimized jointly with standard translation features for a ranking objective.  ...  We perform search by using an SMT decoder in forced decoding mode to produce a bag-ofwords representation of the target documents to be ranked.  ...  Acknowledgments This research was supported in part by DFG grant RI-2221/1-2 "Weakly Supervised Learning of Cross-Lingual Systems".  ... 
doi:10.3115/v1/n15-1123 dblp:conf/naacl/HieberR15 fatcat:226pgclxanfwdmoiyvmhsmlxd4

Superposition Modulo Non-linear Arithmetic [chapter]

Andreas Eggers, Evgeny Kruglov, Stefan Kupferschmid, Karsten Scheibler, Tino Teige, Christoph Weidenbach
2011 Lecture Notes in Computer Science  
Analogous to the behavior of SMT solvers, iSAT tries to solve the problem whether a formula of the form ∃x φ, where φ is a quantifier free boolean combination of non-linear atoms, is satisfiable.  ...  The resulting approach is implemented as SUP(NLA) by a system combination of Spass and iSAT.  ...  Then we check if the formula ¬(∀v ∃u [Λ 2 → Λ 1 σ]) is unsatisfiable in the model of linear arithmetic plus uninterpreted functions by passing it to the SMT solver Z3 [10] .  ... 
doi:10.1007/978-3-642-24364-6_9 fatcat:eaju2bs53zc6nlieyhs6jpnw6q

Satisfiability modulo theories

Leonardo De Moura, Nikolaj Bjørner
2011 Communications of the ACM  
key insights many tools for program analysis, testing, and verification are based on mathematical logic as the calculus of computation. smt solvers are the core engine of many of these tools. modern smt  ...  Model-based testing uses high-level models of software systems, including network protocols, to derive test oracles.  ...  SMT solvers are used to perform bounded model-checking of such descriptions. The main idea of bounded model-checking is to explore a bounded symbolic execution of a program or model.  ... 
doi:10.1145/1995376.1995394 fatcat:c36d7bcz6jcwlhrkvzdqucmgeq

Optimization in SMT with LA(Q) Cost Functions [article]

Roberto Sebastiani, Silvia Tomasi
2012 arXiv   pre-print
In the last decade efficient SMT solvers have been developed for several theories of practical interest (e.g., linear arithmetic, arrays, bit-vectors).  ...  Due to the lack of competitors in AR and SMT domains, we experimentally evaluated our implementation against state-of-the-art tools for the domain of linear generalized disjunctive programming (LGDP),  ...  some such resource; in SMT-based model checking with timed or hybrid systems (e.g  ... 
arXiv:1202.1409v1 fatcat:adeovx2rczcvpkba3tjfxywkxm

Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions [chapter]

Roberto Sebastiani, Silvia Tomasi
2012 Lecture Notes in Computer Science  
In the last decade efficient SMT solvers have been developed for several theories of practical interest (e.g., linear arithmetic, arrays, bit-vectors).  ...  Due to the absence of competitors in AR and SMT domains, we have experimentally evaluated our implementation against state-of-the-art tools for the domain of linear generalized disjunctive programming  ...  some such resource; in SMT-based model checking with timed or hybrid systems (e.g  ... 
doi:10.1007/978-3-642-31365-3_38 fatcat:zyqcahrmdvgbzg5xxpyixx5q3q

Solving constraint satisfaction problems with SAT modulo theories

Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret
2012 Constraints  
We provide extensive performance comparisons between state-of-the-art SMT solvers and most of the available FLATZINC solvers on standard FLATZINC problems.  ...  Although there are results pointing out the adequacy of SMT solvers for solving CSPs, there are no available tools to extensively explore such adequacy.  ...  Algorithm 1 shows a simplified version of an enumeration-based T -satisfiability procedure, borrowed from [14] , where T -consistency is only checked for total Boolean assignments.  ... 
doi:10.1007/s10601-012-9123-1 fatcat:lqasxexolzastg2glfz7mseqoy

Collective Corpus Weighting and Phrase Scoring for SMT Using Graph-Based Random Walk [chapter]

Lei Cui, Dongdong Zhang, Shujie Liu, Mu Li, Ming Zhou
2013 Communications in Computer and Information Science  
Data quality is one of the key factors in Statistical Machine Translation (SMT).  ...  An effective graph-based random walk is designed to estimate the quality of sentence pairs and phrase pairs simultaneously.  ...  We convert the importance scores into new features and integrate them into the log-linear model of the SMT system. Significant improvements are achieved in our experiments.  ... 
doi:10.1007/978-3-642-41644-6_17 fatcat:d3qtmj5rw5acne6okeuaghukou

Active Learning of Combinatorial Features for Interactive Optimization [chapter]

Paolo Campigotto, Andrea Passerini, Roberto Battiti
2011 Lecture Notes in Computer Science  
The algorithm iteratively learns a utility function modeling the quality of candidate solutions and uses it to generate novel candidates for the following refinement.  ...  The optimization stage uses a stochastic local search method to solve a weighted MAX-SAT problem.  ...  It has received consistently increasing attention in recent years, thanks to a number of successful applications in areas like verification systems, planning and model checking.  ... 
doi:10.1007/978-3-642-25566-3_25 fatcat:zxf2ju3tvvg77ibrhtvmuxwduq

An active learning scenario for interactive machine translation

Jesús González-Rubio, Daniel Ortiz-Martínez, Francisco Casacuberta
2011 Proceedings of the 13th international conference on multimodal interfaces - ICMI '11  
An effective approach to translate text documents is to follow an interactive-predictive paradigm in which both the system is guided by the user and the user is assisted by the system to generate error-free  ...  In many situations, text to be translated constitutes an unbounded stream of data that grows continually with time.  ...  We used this data to estimate the initial log-linear model used by our IMT system (see Section 6).  ... 
doi:10.1145/2070481.2070514 dblp:conf/icmi/Gonzalez-RubioOC11 fatcat:kpr3gbir2reitatsak7yma7xwq
« Previous Showing results 1 — 15 out of 1,365 results