Results 31 to 40 of about 18,622 (181)

Simplification of UML/OCL schemas for efficient reasoning [PDF]

, 2017
Ensuring the correctness of a conceptual schema is an essential task in order to avoid the propagation of errors during software development. The kind of reasoning required to perform such task is known to be exponential for UML class diagrams alone and ...
Oriol Hilari, Xavier, Teniente López, Ernest   +1 more
core   +2 more sources

Solving Sat in a Distributed Cloud: A Portfolio Approach

International Journal of Applied Mathematics and Computer Science, 2019
We introduce a new parallel and distributed algorithm for the solution of the satisfiability problem. It is based on an algorithm portfolio and is intended to be used for servicing requests in a distributed cloud.
Ngoko Yanik, Cérin Christophe, Trystram Denis   +2 more
doaj   +1 more source

Fuzzy Maximum Satisfiability

, 2016
In this paper, we extend the Maximum Satisfiability (MaxSAT) problem to {\L}ukasiewicz logic. The MaxSAT problem for a set of formulae {\Phi} is the problem of finding an assignment to the variables in {\Phi} that satisfies the maximum number of formulae.
Abdalla, Areeg, Halaby, Mohamed El
core   +1 more source

Constraint Expressions and Workflow Satisfiability [PDF]

, 2013
A workflow specification defines a set of steps and the order in which those steps must be executed. Security requirements and business rules may impose constraints on which users are permitted to perform those steps.
Crampton, Jason, Gutin, Gregory
core   +1 more source

On Tackling the Limits of Resolution in SAT Solving

, 2017
The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the resolution proof ...
A Atserias, A Biere, A Biere, A Haken, A Morgado, A Morgado, A Morgado, A Urquhart, AA Razborov, C Ansótegui, C Sinz, D Jovanovic, D Jovanović, DL Berre, E Goldberg, E Goldberg, EM Clarke, G Audemard, I Abío, J Davies, J Davies, J Davies, J Huang, J Larrosa, J Marques-Silva, J Nordström, J-W Roorda, JP Warners, K Pipatsrisawat, M Codish, M Koshimura, M Minoux, M Soos, ML Bonet, N Eén, N Eén, N Segerlind, O Bailleux, O Bailleux, P Chatalic, P Saikko, R Asín, R Asín, R Martins, R Martins, S Jabbour, SA Cook, SA Cook, SR Buss, SR Buss, V Chvátal, WF Dowling, WJ Cook, Z Fu   +53 more
core   +1 more source

Incremental Cardinality Constraints for MaxSAT

, 2014
Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints ...
Joshi, Saurabh, Lynce, Ines, Manquinho, Vasco, Martins, Ruben   +3 more
core   +1 more source

Optimal Testing for Planted Satisfiability Problems [PDF]

, 2015
We study the problem of detecting planted solutions in a random satisfiability formula. Adopting the formalism of hypothesis testing in statistical analysis, we describe the minimax optimal rates of detection.
Berthet, Quentin
core   +4 more sources

Spanning Trees in Random Satisfiability Problems

, 2006
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the ...
A Ramezanpour, Kirkpatrick S, Mertens S Mezard M Zecchina R, Mezard M, Montanari A, S Moghimi-Araghi, Seitz S Alava M Orponen P   +6 more
core   +1 more source

Cause Clue Clauses: Error Localization using Maximum Satisfiability [PDF]

, 2011
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization based on a reduction to the maximal satisfiability problem (MAX-SAT), which
Jose, Manu, Majumdar, Rupak
core   +1 more source

R ( 5 , 5 ) ≤ 46 $R(5,5)\le 46$

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) $R(5,5)$ is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley   +1 more source