Filters








62 Hits in 3.6 sec

A Framework for the Specification of Random SAT and QSAT Formulas [chapter]

Nadia Creignou, Uwe Egly, Martina Seidl
2012 Lecture Notes in Computer Science  
We present the framework [q]bfGen which allows the declarative specification of random models for generating SAT and QSAT formulas not necessarily in (prenex) conjunctive normal form.  ...  Consequently, the implementation of specific random formula generators becomes obsolete, because our framework subsumes their functionality.  ...  Conclusion and Future Work We introduced the framework [q]bfGen which provides a language for specifying SAT and QSAT random models and a formula generator which interprets such specifications and which  ... 
doi:10.1007/978-3-642-30473-6_14 fatcat:dp56nvyei5fivowvjzy7liam3a

Traceability Analyses between Features and Assets in Software Product Lines

Ganesh Narwane, José Galindo, Shankara Krishna, David Benavides, Jean-Vivien Millo, S. Ramesh
2016 Entropy  
In a Software Product Line (SPL), the central notion of implementability provides the requisite connection between specifications and their implementations, leading to the definition of products.  ...  The methodology scales much better than the SAT-based solutions hinted in the literature and were demonstrated through a tool called SPLAnE (SPL Analysis Engine) on a large set of SPL models.  ...  Author Contributions: Ganesh Khandu Narwane is responsible for writing the formal framework for SPL.  ... 
doi:10.3390/e18080269 fatcat:56y5r63sabfihluq73ykt3wv7a

Exact finite-state machine identification from scenarios and temporal properties

Vladimir Ulyantsev, Igor Buzhinsky, Anatoly Shalyto
2016 International Journal on Software Tools for Technology Transfer (STTT)  
This paper presents four exact methods to tackle the problem of minimum FSM identification from a set of test scenarios and a temporal specification represented in linear temporal logic.  ...  The methods are implemented as an open-source tool. Three of them are based on translations of the FSM identification problem to SAT or QSAT problem instances.  ...  The second type of specification is a set of LTL formulae. An FSM complies with an LTL formula, if the formula holds for each possible execution of the FSM.  ... 
doi:10.1007/s10009-016-0442-1 fatcat:ne7vicgd65cifprr6uw6d4t6gy

Statistical mechanics of classical and quantum computational complexity [article]

C. R. Laumann, R. Moessner, A. Scardicchio, S. L. Sondhi
2010 arXiv   pre-print
The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous framework for classifying the hardness of problems according to the computational resources, most  ...  These pose unusual and interesting (quantum) statistical mechanical questions and the results shed light on the difficulty of problems for large classes of algorithms as well as providing a window on the  ...  Chris Laumann was partially supported by a travel award of ICAM-I2CAM under NSF grant DMR-0844115.  ... 
arXiv:1009.1635v1 fatcat:7arshy7xmzendiyhnpvylncgru

Solving Sat in a Distributed Cloud: A Portfolio Approach

Yanik Ngoko, Christophe Cérin, Denis Trystram
2019 International Journal of Applied Mathematics and Computer Science  
We introduce a new parallel and distributed algorithm for the solution of the satisfiability problem.  ...  The core of our contribution is the modeling of the optimal resource sharing schedule in parallel executions and the proposition of heuristics for its approximation.  ...  Acknowledgment This work was funded by the Greco project 9 of the French National Agency for Research (ANR).  ... 
doi:10.2478/amcs-2019-0019 fatcat:4lfjp5alx5gc7lsetlqzpcfiue

Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology [chapter]

Markus Hecher, Patrick Thier, Stefan Woltran
2020 Lecture Notes in Computer Science  
Finally, we provide nested DP algorithms and implementations relying on database technology for variants and extensions of Boolean satisfiability.  ...  TDs of a given instance.  ...  The work has been supported by the Austrian Science Fund (FWF), Grants Y698, and P32830, as well as the Vienna Science and Technology Fund, Grant WWTF ICT19-065.  ... 
doi:10.1007/978-3-030-51825-7_25 fatcat:5cdjcgdqrfgzrckiqrnzdox2qy

Algorithms for Quantified Constraint Satisfaction Problems [chapter]

Nikos Mamoulis, Kostas Stergiou
2004 Lecture Notes in Computer Science  
Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified.  ...  We also show how the notion of value interchangeability can be exploited to break symmetries and speed up search by orders of magnitude.  ...  Acknowledgements Kostas Stergiou is a member of the APES research group and would like to thank all other members. We especially thank I. Gent, P. Nightingale, and A. Rowley.  ... 
doi:10.1007/978-3-540-30201-8_60 fatcat:rq63rbq76nd47hlgtiy2q42l6y

Adversarial satisfiability problem

Michele Castellana, Lenka Zdeborová
2011 Journal of Statistical Mechanics: Theory and Experiment  
We also conduct a numerical study of the problem, and find that there are very strong pre-asymptotic effects that are due to the fact that for small sizes exponential and factorial growth is hardly distinguishable  ...  This is one case of a general class of adversarial optimization problems that often arise in practice and are algorithmically much harder than the standard optimization problems.  ...  comments about a preliminary version of the manuscript.  ... 
doi:10.1088/1742-5468/2011/03/p03023 fatcat:gjff7gl2ybcejiolznn45ubr3y

The computational complexity of ideal semantics

Paul E. Dunne
2009 Artificial Intelligence  
We provide efficient algorithmic approaches for the class of bipartite argumentation frameworks and, finally, present a number of technical results which offer strong indications that typical problems  ...  complexity of deciding credulous acceptance: C = np for afs and logic programming (lp) instantiations of abfs; C = Σ p 2 for abfs modelling default theories.  ...  Acknowledgements The author thanks the reviewers for their comments and observations which have improved the presentation of this article.  ... 
doi:10.1016/j.artint.2009.09.001 fatcat:trdp32jl7ffd5kpct6i324ykwa

Model Checking Firewall Policy Configurations

Alan Jeffrey, Taghrid Samak
2009 2009 IEEE International Symposium on Policies for Distributed Systems and Networks  
BDDs are a rich data structure, supporting more logical operations than just solving boolean formulae. Typically, search algorithms for boolean satisfiability (so-called SAT-solvers) outperform BDDs.  ...  To mitigate this problem, there has been recent interest in the use of model checking techniques for analyzing the behavior of firewall policy configurations, and reporting anomalies.  ...  Satisfiability of quantified boolean formulae (QSAT) is the canonical PSPACE-complete problem, in the same way that satisfiability of boolean formulae (SAT) is the canonical 1 Quantified boolean formulae  ... 
doi:10.1109/policy.2009.32 dblp:conf/policy/JeffreyS09 fatcat:wz4qdo5j75bs7oecxze34rgeeu

Responsibility and verification: Importance value in temporal logics [article]

Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch, Stefan Kiefer
2021 arXiv   pre-print
We study this idea in the framework of model-checking with various classical types of linear-time specification, and propose several ways to transpose it to branching ones.  ...  We aim at measuring the influence of the nondeterministic choices of a part of a system on its ability to satisfy a specification.  ...  We will now prove that the QSAT formula is valid if and only if state s is useful. Suppose the QSAT formula is valid, let T = {c i | Q i = ∃}.  ... 
arXiv:2102.06655v2 fatcat:tk5b2mog3rfjhliv4t5ivsjurm

Phase transitions of PP-complete satisfiability problems

Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
2007 Discrete Applied Mathematics  
We also carry out a set of experiments on random instances of # 3SAT( 2 n/2 ) using a natural modification of the Davis-Putnam-Logemann-Loveland (DPLL) procedure.  ...  We investigate the existence of phase transitions for a family of PP-complete Boolean satisfiability problems under the fixed clauses-to-variables ratio model.  ...  Vardi for listening to an informal presentation of the results reported here and offering valuable suggestions on an earlier draft of this paper.  ... 
doi:10.1016/j.dam.2006.09.014 fatcat:en24icmcn5eqpninflwp7zugoq

Parallel Solving of Quantified Boolean Formulas [chapter]

Florian Lonsing, Martina Seidl
2018 Handbook of Parallel Constraint Reasoning  
Hence, QBFs provide an attractive framework for encoding many applications from verification, artificial intelligence, and synthesis, thus motivating the quest for efficient solving technology.  ...  In the same way as the satisfiability problem of propositional logic is the archetypical problem for NP, the satisfiability problem of QBFs is the archetypical problem for PSPACE.  ...  A natural extension of SAT is QSAT, the satisfiability problem of quantified Boolean formulas (QBFs) [32, 47] .  ... 
doi:10.1007/978-3-319-63516-3_4 fatcat:i4s2rjgx3zfi3ll7npc77poiua

On Efficiently Solvable Cases of Quantum k-SAT

Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi
2020 Communications in Mathematical Physics  
The question of whether a given local Hamiltonian is frustration-free, meaning the ground state is the simultaneous ground state of all local interaction terms, is known as the Quantum k-SAT (k-QSAT) problem  ...  We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic  ...  The first result of this project was partially completed while NdB was affiliated with the Centrum Wiskunde & Informatica; SG thanks Ronald de Wolf and Centrum Wiskunde & Informatica for their hospitality  ... 
doi:10.1007/s00220-020-03843-9 fatcat:7ckiwzuqmbhujol3t5o3hlf2ga

Model-Based Testing for Verification Back-Ends [chapter]

Cyrille Artho, Armin Biere, Martina Seidl
2013 Lecture Notes in Computer Science  
We applied this approach to our SAT solver Lingeling and compared it to existing testing approaches, revealing the effectiveness of MBT for the development of reliable SAT solvers.  ...  Many verification tools used in practice rely on sophisticated SAT and SMT solvers. These reasoning engines are assumed and expected to be correct, but, in general, too complex to be fully verified.  ...  It increased the efficiency and productivity of our development process considerably, and particularly allowed us to produce much more complex code.  ... 
doi:10.1007/978-3-642-38916-0_3 fatcat:eplytqoaongjtdkbwury32g6gm
« Previous Showing results 1 — 15 out of 62 results