Results 191 to 200 of about 12,229,216 (240)
Some of the next articles are maybe not open access.
The inequality-satisfiability problem
Operations Research Letters, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hochbaum, Dorit S. +1 more
openaire +2 more sources
IEEE Software, 2007
Successful requirements engineering is about more than just managing requirements. It's also about the relationship to and management of specifications. Typically, traceability structures capture the relationships between requirements, specifications, and domain statements.
openaire +1 more source
Successful requirements engineering is about more than just managing requirements. It's also about the relationship to and management of specifications. Typically, traceability structures capture the relationships between requirements, specifications, and domain statements.
openaire +1 more source
Simplifying clausal satisfiability problems
2005Recently linear 0–1 programming methods have been successfully applied to the satisfiability problem of propositional logic. We present a preprocessing method that simplifies the linear 0–1 integer problem corresponding to a clausal satisfiability problem.
openaire +2 more sources
Feature interaction as a satisfiability problem
MASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2003We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the specification of additional features (call waiting, call forwarding, etc.).
Areces, C.E., Bouma, W., de Rijke, M.
openaire +4 more sources
A Complexity Index for Satisfiability Problems
SIAM Journal on Computing, 1994Summary: This paper associates a linear programming problem (LP) to any conjunctive normal form \(\phi\), and shows that the optimum value \(Z(\phi)\) of this LP measures the complexity of the corresponding SAT (Boolean satisfiability) problem. More precisely, there is an algorithm for SAT that runs in polynomial time on the class of satisfiability ...
Boros, Endre +3 more
openaire +1 more source
Satisfiability Problems for OFDDs
1996We investigate the complexity of problems on Ordered Functional Decision Diagrams (OFDDs) related to satisfiability, i.e. SAT-ONE, SAT-ALL, and SAT-COUNT. We prove that SAT-ALL has a running time linear in the product of the number of satisfying assignments and the size of the given OFDD.
Ralph Werchner +3 more
openaire +1 more source
On the Minimum Satisfiability Problem
2020We characterize the optimal solution to the LP relaxation of the standard formulation for the minimum satisfiability problem. Based on the characterization, we give a \(O(nm^2)\) combinatorial algorithm to solve the fractional version of the minimum satisfiability problem optimally where n(m) is the number of variables (clauses).
Umair Arif +3 more
openaire +1 more source
Satisfiability problems for propositional calculi
Mathematical Systems Theory, 1979For each fixed set of Boolean connectives, how hard is it to determine satisfiability for formulas with only those connectives? We show that a condition sufficient for NP-completeness is that the functionx Λ ~ y be representable, and that any set of connectives not capable of representing this function has a polynomial-time satisfiability problem.
openaire +1 more source
A randomized diversification strategy for solving satisfiability problem with long clauses
Science China Information Sciences, 2017Jian Gao, Ruizhi Li, Minghao Yin
semanticscholar +1 more source