Filters








261,439 Hits in 4.6 sec

Solving the incremental satisfiability problem

J.N. Hooker
1993 The Journal of Logic Programming  
Rather than re-solve the satisfiability problem from scratch, we propose to use information gained while solving the original problem, so as to speed the solution of the new problem.  ...  We then solve the incremented problem with a modified DPL algorithm that takes advantage of the information in the data structure generated during the solution of the original  ...  This work was supported in part by the U.S. Air Force Office of Scientific Research Grant AFOSR-91-0287. GSIA Working Paper 1991-9.  ... 
doi:10.1016/0743-1066(93)90018-c fatcat:wkqs72tgxngu5hnss44l6sqtuq

On Incremental Core-Guided MaxSAT Solving [chapter]

Xujie Si, Xin Zhang, Vasco Manquinho, Mikoláš Janota, Alexey Ignatiev, Mayur Naik
2016 Lecture Notes in Computer Science  
This paper aims to improve the efficiency of unsat coreguided MaxSAT solving on a sequence of similar problem instances.  ...  In particular, we consider the case when the sequence is constructed by adding new hard or soft clauses. Our approach is akin to the well-known idea of incremental SAT solving.  ...  The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright thereon.  ... 
doi:10.1007/978-3-319-44953-1_30 fatcat:ryzynklnyvdphi4jpbt7peinlm

Asynchronous Multi-core Incremental SAT Solving [chapter]

Siert Wieringa, Keijo Heljanko
2013 Lecture Notes in Computer Science  
Through the asynchronous interface multiple problems can be given to the solver simultaneously. This enables conceptually simple but efficient parallelization of the solving process.  ...  Such research typically ignores the incremental problem specification feature that modern SAT solvers possess. This feature is, however, crucial for many of the real-life applications of SAT solvers.  ...  The Tarmo solver, the modified versions of TIP, and more experimental data can be found from http://users.ics.aalto.fi/swiering/tacas13.  ... 
doi:10.1007/978-3-642-36742-7_10 fatcat:5kf5ioae7nadhghlm4m6ulejtu

On applying incremental satisfiability to delay fault testing

Joonyoung Kim, Jesse Whittemore, João P. Marques-Silva, Karem Sakallah
2000 Proceedings of the conference on Design, automation and test in Europe - DATE '00  
In this paper, we present a method to simultaneously solve several closely related SAT instances using incremental satisfiability (ISAT).  ...  The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification.  ...  Conclusions In this paper, we presented a method of solving incremental satisfiability problems (ISAT) which can check the satisfiability of a family of related functions.  ... 
doi:10.1145/343647.343801 fatcat:gozzlhnokbf5blgmi7ehnmr6du

Incremental QBF Solving by DepQBF [chapter]

Florian Lonsing, Uwe Egly
2014 Lecture Notes in Computer Science  
We present the search-based QBF solver DepQBF which allows to solve a sequence of QBFs incrementally.  ...  We illustrate incremental QBF solving and potential usage scenarios by examples. Incremental QBF solving has the potential to considerably improve QBF-based workflows in many application domains.  ...  The result of the satisfiability check is then mapped back and interpreted on the level of the problem instance.  ... 
doi:10.1007/978-3-662-44199-2_48 fatcat:25zaykf4kjfljlqpgoho3wpyrm

Incremental Cardinality Constraints for MaxSAT [chapter]

Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce
2014 Lecture Notes in Computer Science  
Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem.  ...  These results suggest that incremental cardinality constraints could be beneficial for other constraint solving domains.  ...  Incremental SAT solving addresses these problems by using assumptions [22] . To the best of our knowledge this approach has not been extended for incremental MaxSAT solving.  ... 
doi:10.1007/978-3-319-10428-7_39 fatcat:cjn55eryfvhtpj4dh7sxk66zle

Conformant Planning as a Case Study of Incremental QBF Solving [chapter]

Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler
2014 Lecture Notes in Computer Science  
Our results are the first empirical study of incremental QBF solving in the context of planning and motivate its use in other application domains.  ...  Experimental results show that incremental QBF solving outperforms non-incremental QBF solving.  ...  , and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/978-3-319-13770-4_11 fatcat:fkrtsv4ez5hslhtuek24o2mzs4

Conformant planning as a case study of incremental QBF solving

Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler
2016 Annals of Mathematics and Artificial Intelligence  
We consider planning with uncertainty in the initial state as a case study of incremental quantified Boolean formula (QBF) solving.  ...  For DepQBF, experimental results show that incremental QBF solving with incremental QBCE outperforms incremental QBF solving without QBCE, which in turn outperforms  ...  , and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/s10472-016-9501-2 fatcat:2pgojtu73jdebhorc36337xqpq

Implicit Formulation of Homogenization Method for Periodic Elastoplastic Solids

Takashi Asada, Nobutada Ohno
2007 Key Engineering Materials  
to solve the homogenization problem.  ...  It is thus demonstrated that the convergence in iteratively solving the homogenization problem strongly depends on the initial setting of strain increments in unit cells, and that quick convergences can  ...  Acknowledgement The authors are grateful to Dr. D. Okumura, Nagoya University, for his kind discussion to the results in the present study.  ... 
doi:10.4028/www.scientific.net/kem.340-341.1055 fatcat:hgbo5pasmre5fd5zz2nuc34ece

Dynamic constraint weighting for over-constrained problems [chapter]

John Thornton, Abdul Sattar
1998 Lecture Notes in Computer Science  
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable.  ...  problems.  ...  Particular interest has focussed on the use of GSAT and variants to solve Conjunctive Normal Form (CNF) satisfiability problems [7] .  ... 
doi:10.1007/bfb0095285 fatcat:rqz4dix5xfd45fpex62brfroe4

Adding Capacity Points to a Wireless Mesh Network Using Local Search

J. Robinson, M. Uysal, R. Swaminathan, E. Knightly
2008 2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications  
Gateway Placement • To maximize network capacity • Three coupled sub-problems: Adapt two local search algorithms Allows incremental deployment without full recalculation Solves (2) and (3  ...  Client association with mesh nodes Adapt two local search algorithms Allows incremental deployment without full recalculation Solves (2) and (3) as assignment problem From algorithms for Facility  ... 
doi:10.1109/infocom.2007.181 fatcat:4pym4j6borh6vbkjkhn4tb4wim

Adding Capacity Points to a Wireless Mesh Network Using Local Search

J. Robinson, M. Uysal, R. Swaminathan, E. Knightly
2008 IEEE INFOCOM 2008 - The 27th Conference on Computer Communications  
Gateway Placement • To maximize network capacity • Three coupled sub-problems: Adapt two local search algorithms Allows incremental deployment without full recalculation Solves (2) and (3  ...  Client association with mesh nodes Adapt two local search algorithms Allows incremental deployment without full recalculation Solves (2) and (3) as assignment problem From algorithms for Facility  ... 
doi:10.1109/infocom.2008.181 dblp:conf/infocom/RobinsonUSK08 fatcat:venuqovdtvhelntd7gvcvyxfae

Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability [chapter]

Luís Baptista, João Marques-Silva
2000 Lecture Notes in Computer Science  
We use instances of SAT from the hardware verification domain to provide evidence that randomization can indeed be essential in solving real-world satisfiable instances of SAT.  ...  Finally, we utilize and expand the idea of algorithm portfolio design to propose an alternative approach for solving hard unsatisfiable instances of SAT. 1 The superscalar processor verification instances  ...  Introduction Recent work on the Satisfiability Problem (SAT) has provided experimental and theoretical evidence that randomization and restart strategies can be quite effective at solving hard satisfiable  ... 
doi:10.1007/3-540-45349-0_36 fatcat:e3ciqfcyabdgvo5kp6bckoffte

An Evolutionary Local Search Method for Incremental Satisfiability [chapter]

Mohamed El Bachir Menaï
2004 Lecture Notes in Computer Science  
Incremental satisfiability problem (ISAT) is considered as a generalisation of the Boolean satisfiability problem (SAT).  ...  It has only one free parameter and had proved competitive with the more elaborate stochastic local search methods on many hard optimization problems such as MAXSAT problem.  ...  Acknowledgment The author is grateful to the anonymous referees for their valuable comments and suggestions.  ... 
doi:10.1007/978-3-540-30210-0_13 fatcat:63vcfygkujhwtid44d5wqslwpq

Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion

Kazuo Yonekura, Yoshihiro Kanno
2011 Optimization and Engineering  
The minimization problems of the potential energy and the complementary energy for incremental analysis are then formulated as the primal-dual pair of SOCP problems, which can be solved with a primal-dual  ...  In the course of the quasistatic analysis, the incremental problem is solved repeatedly by changing the loading conditions stepwise and updating state variables.  ...  The work of the second author (Y. Kanno) was also supported by Global COE Program "The research and training center for new development in mathematics."  ... 
doi:10.1007/s11081-011-9144-4 fatcat:grnt7apnfbgvdiicstgwz2dwga
« Previous Showing results 1 — 15 out of 261,439 results