3238 search results - page 151 / 648 » On the Computational Interpretation of Negation |
183
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
158
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
We present a restriction of Resolution modulo where the rewrite rules are such that clauses rewrite to clauses, so that the reduct of a clause needs not be further transformed into...
161
click to vote
NAACL
2010
15 years 4 months ago
2010
Several methods for automatically generating labeled examples that can be used as training data for WSD systems have been proposed, including a semisupervised approach based on re...
151
click to vote
POPL
1995
ACM
15 years 10 months ago
1995
ACM
Obliq is a lexically-scoped, untyped, interpreted language that supports distributed object-oriented computation. Obliq objects have state and are local to a site. Obliq computati...
185
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...