Sciweavers

662 search results - page 50 / 133
» Formalizing Basic First Order Model Theory
Sort
View
KR
2004
Springer
14 years 1 months ago
Knowledge Discovery by Reversing Inductive Knowledge Representation
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...
Gabriele Kern-Isberner, Jens Fisseler
TCS
2002
13 years 7 months ago
Tilings as a programming exercise
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...
Guy Cousineau
JWSR
2006
113views more  JWSR 2006»
13 years 7 months ago
Search Strategies for Automatic Web Service Composition
: We investigate architectural properties required for supporting automatic service composition. First, composable service architecture will be described, based on modeling Web ser...
Nikola Milanovic, Miroslaw Malek
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
13 years 11 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
ACL
1994
13 years 9 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick