128 search results - page 20 / 26 » Logical Data Independence Reconsidered (Extended Abstract) |
111
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
92
Voted
DLOG
2010
14 years 9 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
87
Voted
SIAMCOMP
2000
14 years 11 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
113
click to vote
CADE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...