Sciweavers

479 search results - page 55 / 96
» A quantified logic of evidence
Sort
View
IJCNN
2006
IEEE
14 years 2 months ago
Semi-supervised feature selection via multiobjective optimization
Abstract— In previous work, we have shown that both unsupervised feature selection and the semi-supervised clustering problem can be usefully formulated as multiobjective optimiz...
Julia Handl, Joshua D. Knowles
CADE
2005
Springer
14 years 8 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
IPPS
2007
IEEE
14 years 2 months ago
A Study of Design Efficiency with a High-Level Language for FPGAs
Over the years reconfigurable computing devices such as FPGAs have evolved from gate-level glue logic to complex reprogrammable processing architectures. However, the tools used f...
Zain-ul-Abdin, Bertil Svensson
ISCIS
2004
Springer
14 years 1 months ago
System BV without the Equalities for Unit
System BV is an extension of multiplicative linear logic with a non-commutative self-dual operator. In this paper we present systems equivalent to system BV where equalities for un...
Ozan Kahramanogullari
ERSHOV
2001
Springer
14 years 16 days ago
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Jan Friso Groote, Hans Zantema