42 search results - page 6 / 9 » Algorithms for computing backbones of propositional formulae |
135
Voted
FOSSACS
2005
Springer
15 years 9 months ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
147
Voted
CAV
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
119
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
135
Voted
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
143
Voted
AIPS
2003
15 years 5 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...