Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,190
Propositional Formulas
"... ell-formed 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 meta-symbol that also denotes implication, but in this context it is ..."
Abstract
- Add to MetaCart
ell-formed 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 meta-symbol 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 product-line. 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 308 (14 self)
- Add to MetaCart
, and propositional formulas. This connection allows arbitrary propositional constraints to be defined among features and enables off-the-shelf 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
Structure and Satisfiability in Propositional Formulae
- AI*IA Notizie
"... The thesis [1] concerns propositional satisfiability (SAT). As it is well known, this problem consists in deciding whether, given a formula f, there exists at least one truth assignment that satisfies f; a particular assignment having this property ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
The thesis [1] concerns propositional satisfiability (SAT). As it is well known, this problem consists in deciding whether, given a formula f, there exists at least one truth assignment that satisfies f; a particular assignment having this property
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 (1 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
Stable Models of Fuzzy Propositional Formulas
"... Abstract. We introduce the stable model semantics for fuzzy propositional for-mulas, which generalizes both fuzzy propositional logic and the stable model se-mantics of Boolean propositional formulas. Combining the advantages of both for-malisms, the introduced language allows highly configurable de ..."
Abstract
- Add to MetaCart
Abstract. We introduce the stable model semantics for fuzzy propositional for-mulas, which generalizes both fuzzy propositional logic and the stable model se-mantics of Boolean propositional formulas. Combining the advantages of both for-malisms, the introduced language allows highly configurable
The semantics of Gringo and infinitary propositional formulas
- In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR
, 2014
"... Input languages of answer set solvers are based on the mathe-matically simple concept of a stable model. But many useful constructs available in these languages, including local vari-ables, conditional literals, and aggregates, cannot be easily explained in terms of stable models in the sense of the ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
the problem of defining the semantics of GRINGO programs by translating them into the language of infinitary propositional formulas. This semantics allows us to study equivalent trans-formations of GRINGO programs using natural deduction in infinitary propositional logic, so that the properties
Algorithms for Computing Backbones of Propositional Formulae∗
"... The problem of propositional satisfiability (SAT) has found a number of applications in both theoreti-cal and practical computer science. In many appli-cations, 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 theoreti-cal and practical computer science. In many appli-cations, however, knowing a formula’s satisfiability alone is insufficient. Often, some other properties of the formula need to be computed
Results 1 - 10
of
2,190
