40 search results - page 5 / 8 » Inferring Descriptive Generalisations of Formal Languages |
124
Voted
WWW
2008
ACM
16 years 10 days ago
2008
ACM
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
96
Voted
ECAI
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
94
Voted
SAC
2005
ACM
15 years 5 months ago
2005
ACM
Finding rapidly suitable experts in an organization to compose a team able to solve specific tasks is a typical problem in large consulting firms. In this paper we present a Des...
115
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
92
Voted
TOCL
2008
14 years 11 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...