Sciweavers

2783 search results - page 49 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ENTCS
2008
114views more  ENTCS 2008»
15 years 1 months ago
Term-graph Rewriting in Tom Using Relative Positions
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
Emilie Balland, Paul Brauner
JSYML
2000
69views more  JSYML 2000»
15 years 1 months ago
Topological Elementary Equivalence of Closed Semi-Algebraic Sets in The Real Plane
We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol...
Bart Kuijpers, Jan Paredaens, Jan Van den Bussche
EUSFLAT
2009
120views Fuzzy Logic» more  EUSFLAT 2009»
14 years 11 months ago
On M-Approximative Operators and M-Approximative Systems
Abstract-- The concept of an M-approximative system is introduced. Basic properties of the category of M-approximative systems and in a natural way defined morphisms between them a...
Alexander P. Sostak
IJCAI
2001
15 years 2 months ago
Probabilistic Classification and Clustering in Relational Data
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
Benjamin Taskar, Eran Segal, Daphne Koller
ILP
2007
Springer
15 years 7 months ago
Building Relational World Models for Reinforcement Learning
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...