Sciweavers

454 search results - page 14 / 91
» Representation results for defeasible logic
Sort
View
LREC
2010
202views Education» more  LREC 2010»
13 years 10 months ago
Can Syntactic and Logical Graphs help Word Sense Disambiguation?
This paper presents a word sense disambiguation (WSD) approach based on syntactic and logical representations. The objective here is to run a number of experiments to compare stan...
Amal Zouaq, Michel Gagnon, Benoît Ozell
ICCAD
1997
IEEE
97views Hardware» more  ICCAD 1997»
14 years 24 days ago
Low power logic synthesis for XOR based circuits
An abundance of research e orts in low power logic synthesis have so far been focused on and or or nand nor based logic. A typical approach is to rst generate an initial multi-lev...
Unni Narayanan, C. L. Liu
RIAO
2007
13 years 10 months ago
Effectiveness of Rich Document Representation in XML Retrieval
Information Retrieval (IR) systems are built with different goals in mind. Some IR systems target high precision that is to have more relevant documents on the first page of their...
Fahimeh Raja, Mostafa Keikha, Maseud Rahgozar, Far...
ICCAD
1997
IEEE
171views Hardware» more  ICCAD 1997»
14 years 24 days ago
The disjunctive decomposition of logic functions
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
Valeria Bertacco, Maurizio Damiani
AMAST
2006
Springer
14 years 10 days ago
Fork Algebras as a Sufficiently Rich Universal Institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
Carlos López Pombo, Marcelo F. Frias