2062 search results - page 137 / 413 » Derivatives of Logical Formulas |
132
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
149
click to vote
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...
131
click to vote
JISE
2006
15 years 4 months ago
2006
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
125
click to vote
JCSS
2007
15 years 4 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
163
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...