Sciweavers

454 search results - page 61 / 91
» Representation results for defeasible logic
Sort
View
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 2 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
ISMVL
2010
IEEE
158views Hardware» more  ISMVL 2010»
14 years 18 days ago
An Evolutionary Algorithm for Optimization of Pseudo Kronecker Expressions
—Using EXOR gates in logic synthesis often results in smaller circuit realizations. While in AND/OR synthesis the problem definition is clear, in AND/EXOR synthesis several clas...
Alexander Finder, Rolf Drechsler
NAACL
2007
13 years 10 months ago
First-Order Probabilistic Models for Coreference Resolution
Traditional noun phrase coreference resolution systems represent features only of pairs of noun phrases. In this paper, we propose a machine learning method that enables features ...
Aron Culotta, Michael L. Wick, Andrew McCallum
ISCI
2006
136views more  ISCI 2006»
13 years 8 months ago
Computing with words for text processing: An approach to the text categorization
The use of the computing with words paradigm for the automatic text documents categorization problem is discussed. This specific problem of information retrieval (IR) becomes more...
Slawomir Zadrozny, Janusz Kacprzyk
ICFP
2010
ACM
13 years 9 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal