Results 1  10
of
325,027
Propositional Formulas
"... ellformed propositional formulas over V is defined by 1. V # P 2. u, v # P =# (u # v) # P 3. u, v # P =# (u # v) # P 4. u # P =# u # P 5. No other strings of symbols are in P . Note that " =# " is a metasymbol that also denotes implication, but in this context it is ..."
Abstract
 Add to MetaCart
ellformed propositional formulas over V is defined by 1. V # P 2. u, v # P =# (u # v) # P 3. u, v # P =# (u # v) # P 4. u # P =# u # P 5. No other strings of symbols are in P . Note that " =# " is a metasymbol that also denotes implication, but in this context
Feature models, grammars, and propositional formulas
, 2005
"... Abstract. Feature models are used to specify members of a productline. Despite years of progress, contemporary tools provide limited support for feature constraints and offer little or no support for debugging feature models. We integrate prior results to connect feature models, grammars, and propo ..."
Abstract

Cited by 299 (12 self)
 Add to MetaCart
, and propositional formulas. This connection allows arbitrary propositional constraints to be defined among features and enables offtheshelf satisfiability solvers to debug feature models. We also show how our ideas can generalize recent results on the staged configuration of feature models.
Reducing Signed Propositional Formulas
, 1998
"... New strategies of reduction for finite valued propositional logics are introduced in the framework of the TAS methodology developed by the authors [1]. A new data structure, the #sets, is introduced to store information about the formula being analysed, and its usefulness is shown by developing ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
New strategies of reduction for finite valued propositional logics are introduced in the framework of the TAS methodology developed by the authors [1]. A new data structure, the #sets, is introduced to store information about the formula being analysed, and its usefulness is shown
Elliptic Approximations of Propositional Formulae
 Discrete Appl. Math
, 1996
"... . A propositional formula can be approximated by a concave quadratic function. This approximation is obtained as a second order Taylor expansion of a convex smooth model. It is shown that in the 3 SAT case, the involved parameters can be set to such values that yield optimal discriminative properti ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
. A propositional formula can be approximated by a concave quadratic function. This approximation is obtained as a second order Taylor expansion of a convex smooth model. It is shown that in the 3 SAT case, the involved parameters can be set to such values that yield optimal discriminative
Stable Models of Fuzzy Propositional Formulas
"... Abstract. We introduce the stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of Boolean propositional formulas. Combining the advantages of both formalisms, the introduced language allows highly configurable de ..."
Abstract
 Add to MetaCart
Abstract. We introduce the stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of Boolean propositional formulas. Combining the advantages of both formalisms, the introduced language allows highly configurable
The Propositional Formula Checker HeerHugo
 JOURNAL OF AUTOMATED REASONING
, 1999
"... HeerHugo is a propositional formula checker that determines whether a given formula is satisfiable or not. Its main ingredient is the branch/merge rule, that is inspired by an algorithm proposed by Stallmarck, which is protected by a software patent. The algorithm can be interpreted as a breadth f ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
HeerHugo is a propositional formula checker that determines whether a given formula is satisfiable or not. Its main ingredient is the branch/merge rule, that is inspired by an algorithm proposed by Stallmarck, which is protected by a software patent. The algorithm can be interpreted as a breadth
Algorithms for Computing Backbones of Propositional Formulae∗
"... The problem of propositional satisfiability (SAT) has found a number of applications in both theoretical and practical computer science. In many applications, however, knowing a formula’s satisfiability alone is insufficient. Often, some other properties of the formula need to be computed. This ar ..."
Abstract
 Add to MetaCart
The problem of propositional satisfiability (SAT) has found a number of applications in both theoretical and practical computer science. In many applications, however, knowing a formula’s satisfiability alone is insufficient. Often, some other properties of the formula need to be computed
A Simplifier for Propositional Formulas with Many Binary Clauses
, 2001
"... Deciding whether a propositional formula in conjunctive normal form is satisfiable (SAT) is an NPcomplete problem. The problem becomes linear when the formula contains binary clauses only. Interestingly, the reduction to SAT of a number of wellknown and important problems  such as classical AI p ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
Deciding whether a propositional formula in conjunctive normal form is satisfiable (SAT) is an NPcomplete problem. The problem becomes linear when the formula contains binary clauses only. Interestingly, the reduction to SAT of a number of wellknown and important problems  such as classical AI
Detecting Inadmissible and Necessary Variables in Large Propositional Formulae
 University of Siena
, 2001
"... A variable in a propositional formula is called inadmissible (necessary) if it is false (true) in each satisfying variable assignment of the formula. We describe and compare three algorithms for the detection of the set of necessary and inadmissible variables of a formula using SAT methods: a basic ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
A variable in a propositional formula is called inadmissible (necessary) if it is false (true) in each satisfying variable assignment of the formula. We describe and compare three algorithms for the detection of the set of necessary and inadmissible variables of a formula using SAT methods: a basic
Results 1  10
of
325,027