Sciweavers

2783 search results - page 148 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
AGTIVE
2003
Springer
15 years 11 months ago
Modeling Discontinuous Constituents with Hypergraph Grammars
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can ...
Ingrid Fischer
ECML
1998
Springer
15 years 10 months ago
First-Order Learning for Web Mining
We present compelling evidence that the World Wide Web is a domain in which applications can benefit from using first-order learning methods, since the graph structure inherent in ...
Mark Craven, Seán Slattery, Kamal Nigam
ECAI
2004
Springer
15 years 10 months ago
Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. ...
Ofer Arieli
EUSFLAT
2007
105views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Representing Incomplete Knowledge about Fuzzy Sets
This paper deals with interval-valued fuzzy sets and I-fuzzy sets, Atanassov's intuitionistic fuzzy sets. They are treated in a systematic way as two, formally equivalent, na...
Maciej Wygralak
EJC
2006
15 years 6 months ago
Matroid tree-width
Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
Petr Hlinený, Geoff Whittle