Filters








13,894 Hits in 3.9 sec

Abstract Requirement Analysis in Multiagent System Design

Scott J. Harmon, Scott A. DeLoach, Robby
2009 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology  
We describe a framework for analyzing a design allowing decisions about what qualities are more important to be made at design-time.  ...  The stake-holder has certain abstract qualities in mind: efficiency, quality, reliability, and so forth. How do we make sure our system is guided by these qualities?  ...  If we have statistics on capability failure, we can even compute a probability of conflict.  ... 
doi:10.1109/wi-iat.2009.133 dblp:conf/iat/HarmonDR09 fatcat:2g7lcl7krfbuzpgb3rmvcy7o3y

Conflict-Directed A* Search for Soft Constraints [chapter]

Martin Sachenbacher, Brian C. Williams
2006 Lecture Notes in Computer Science  
Experimental results indicate that this hybrid approach is in some cases more efficient than other known methods for solving soft constraints.  ...  In this paper, we present an approach to solving soft constraints that exploits this disparity by re-formulating soft constraints into an optimization part (with unary objective functions), and a satisfiability  ...  We presented an instance of this approach, called conflict-directed A*, and its prototypic implementation on top of a SAT solver.  ... 
doi:10.1007/11757375_16 fatcat:6fbinxwzava4nn4uwpf7cuxjre

Using CSP look-back techniques to solve exceptionally hard SAT instances [chapter]

Roberto J. Bayardo, Robert Schrag
1996 Lecture Notes in Computer Science  
backjumping and learning --are of little use for SAT.  ...  Without them, most instances are "exceptionally hard" -orders of magnitude harder than typical Random 3-SAT instances with the same surface characteristics.  ...  Acknowledgments We wish to thank Jimi Crawford for the Tableau executable and assistance in replicating its behavior.  ... 
doi:10.1007/3-540-61551-2_65 fatcat:lzziqwsq5rdw7e2cj73eftivpq

Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles [chapter]

Andreas Bauer
2005 Lecture Notes in Computer Science  
The chosen approach is twofold: firstly, the problem of contradicting first order system descriptions with a set of observations is reduced to propositional logic using the notion of symptoms, and secondly  ...  SAT-solvers.  ...  Acknowledgements The author thanks his colleagues Gernot Stenz and Reinhold Letz for insightful discussions regarding SAT-solving and for their comments on the technicalities of the implementation.  ... 
doi:10.1007/11493853_6 fatcat:syg6wuhiyjeldo7rm2wwtghu54

Model-based runtime analysis of distributed reactive systems

A. Bauer, M. Leucker, C. Schallhart
2006 Australian Software Engineering Conference (ASWEC'06)  
In this paper, we present a novel and efficient approach for analysing reactive distributed systems at runtime, in that we provide a framework for detecting failures as well as identifying their causes  ...  Our framework is built modular, layered, and uses merely a minimal communication overhead-especially when compared to other, similar approaches.  ...  Using the monitors in combination with diagnosis, we have at hand a propositional, hence, very efficient mechanism for differentiating symptoms for a failure, i. e., ¬ok(o 1 ), from actual causes, e. g  ... 
doi:10.1109/aswec.2006.36 dblp:conf/aswec/0002LS06 fatcat:tl2c2einebcfbmpvulntw5tyai

VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search [chapter]

Eric I. Hsu, Sheila A. McIlraith
2009 Lecture Notes in Computer Science  
A second, algorithmic, contribution is to present four novel inference techniques that combine BP/SP models with local/global consistency constraints via the EMBP framework.  ...  Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively.  ...  For typical SAT contest problems, we have found .9 to be a good value in combination with the other settings decided in this section.  ... 
doi:10.1007/978-3-642-02777-2_35 fatcat:mwnm3iq3azdflkpznhlkonqkmi

A high order method for orbital conjunctions analysis: Monte Carlo collision probability computation

Alessandro Morselli, Roberto Armellin, Pierluigi Di Lizia, Franco Bernelli Zazzera
2015 Advances in Space Research  
These are introduced to further improve the efficiency and accuracy of Monte Carlo collision probability computation, in particular for cases of very low collision probabilities.  ...  When a close approach is identified, the dependence of the TCA and DCA on the uncertainties in the initial states is efficiently computed with differential algebra (DA) techniques.  ...  The authors are grateful to Martin Berz and Kyoko Makino for having introduced us to differential algebra techniques as well as for the implementation of COSY INFINITY, without which this work would not  ... 
doi:10.1016/j.asr.2014.09.003 fatcat:najwnn7cuvdu3lobzasshjxcua

GridSAT: a system for solving satisfiability problems using a computational grid

Wahid Chrabakh, Rich Wolski
2006 Parallel Computing  
Based on the sequential Chaff [32] algorithm, we combine new distributed clause "learning" techniques with an efficient and autonomous grid implementation both to speed the time to solution and to solve  ...  We describe our enhancements to the Chaff learning algorithm that have enabled an efficient distributed implementation, and detail the technological approach we have taken to realizing this implementation  ...  Conclusion We have described GridSAT a distributed satisfiability solver for the computational grid. GridSAT is shown capable of running on a dynamic and heterogeneous set of resources.  ... 
doi:10.1016/j.parco.2006.01.004 fatcat:kaxho5wamndtxpxh7ykx3zkbby

Incorporating Clause Learning in Grid-Based Randomized SAT Solving1

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä, Youssef Hamadi
2009 Journal on Satisfiability, Boolean Modeling and Computation  
Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving.  ...  The approach exploits existing state-of-the-art clause learning SAT solvers by embedding them with virtually no modifications.  ...  The approach is based on combining (i) a natural method for solving SAT in parallel by independent randomized SAT solvers, and (ii) the powerful conflict driven clause learning technique employed in many  ... 
doi:10.3233/sat190069 fatcat:5ercxhd4tbeyfcobldbcty4i5e

Constrained Sampling and Counting: Universal Hashing Meets SAT Solving [article]

Kuldeep S. Meel, Moshe Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik
2015 arXiv   pre-print
Recently, we proposed a novel approach that combines universal hashing and SAT solving and scales to formulas with hundreds of thousands of variables without giving up correctness guarantees.  ...  This paper provides an overview of the key ingredients of the approach and discusses challenges that need to be overcome to handle larger real-world instances.  ...  The failure probability for such generators must be bounded by a constant strictly less than 1. The constrained-counting problem is to compute the size of the set R F for a given CNF formula F .  ... 
arXiv:1512.06633v1 fatcat:fhs6yqqsavcedhmw3frs6mi6pi

Towards scalable system-level reliability analysis

Michael Glaß, Martin Lukasiewycz, Christian Haubelt, Jürgen Teich
2010 Proceedings of the 47th Design Automation Conference on - DAC '10  
The ability of both methods to accurately analyze larger and more complex systems than known approaches is demonstrated for various test cases.  ...  The contribution of this paper is twofold: (1) A partitioning-based early quantification technique is presented that aims to keep the size of the BDDs during construction at minimum. (2) A SAT-assisted  ...  The experiments are carried out on an Intel Pentium 4 3.00 GHz Dual Core machine with 1.5 GB RAM. The number of simulation runs for the SAT approach is set to 2000.  ... 
doi:10.1145/1837274.1837334 dblp:conf/dac/GlassLHT10 fatcat:rfld3jh7engkvbsaio3iab35hy

Designing heterogeneous ECU networks via compact architecture encoding and hybrid timing analysis

Michael Glaß, Martin Lukasiewycz, Jürgen Teich, Unmesh D. Bordoloi, Samarjit Chakraborty
2009 Proceedings of the 46th Annual Design Automation Conference on ZZZ - DAC '09  
The ability of both methods to accurately analyze larger and more complex systems than known approaches is demonstrated for various test cases.  ...  The contribution of this paper is twofold: (1) A partitioning-based early quantification technique is presented that aims to keep the size of the BDDs during construction at minimum. (2) A SAT-assisted  ...  The experiments are carried out on an Intel Pentium 4 3.00 GHz Dual Core machine with 1.5 GB RAM. The number of simulation runs for the SAT approach is set to 2000.  ... 
doi:10.1145/1629911.1629925 dblp:conf/dac/GlassLTBC09 fatcat:bq7vgywugvguhozsfnmxkmgsla

Propositional Satisfiability and Constraint Programming

Lucas Bordeaux, Youssef Hamadi, Lintao Zhang
2006 ACM Computing Surveys  
Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research, cross-fertilising occasionally.  ...  They also exhibit differences in the way they are used to state and solve problems, since SAT's approach is in general a black-box approach, while CP aims at being tunable and programmable.  ...  Now when the failure is detected for all values of variable x 4 , the union of the conflict set obtained for · 41 each branch is computed -here we obtain {x 1 }.  ... 
doi:10.1145/1177352.1177354 fatcat:rpyvelu3crgadoptwu3ispmime

Lazy Satisfiability Modulo Theories

Roberto Sebastiani
2007 Journal on Satisfiability, Boolean Modeling and Computation  
An amount of papers with novel and very efficient techniques for SMT has been published in the last years, and some very efficient SMT tools are now available.  ...  In this paper we present an extensive survey of SMT, with particular focus on the lazy approach.  ...  the most efficient SMT tools are based on the lazy approach combining state-of-the-art DPLL implementations with specialized T i -solvers.  ... 
doi:10.3233/sat190034 fatcat:xtomk52xrvexxe75sloor4hdcm

Insights into Parallelism with Intensive Knowledge Sharing [chapter]

Ashish Sabharwal, Horst Samulowitz
2014 Lecture Notes in Computer Science  
Furthermore, we show that in a parallel setting there exists a surprising tradeoff between the well-known communication cost for knowledge sharing across multiple compute nodes and the so far neglected  ...  We then explain that such static or explicit splitting approaches are not as effective in the context of parallel combinatorial search with intensive knowledge acquisition and sharing such as parallel  ...  in desirable search space splitting properties that have been exploited in theoretical computer science [5, 29] as well as in the design of practically efficient approaches for approximating the number  ... 
doi:10.1007/978-3-319-10428-7_48 fatcat:ciump67oivgerfeo7yjpitoos4
« Previous Showing results 1 — 15 out of 13,894 results