Sciweavers

382 search results - page 26 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
ICLP
1999
Springer
13 years 12 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
MOZ
2004
Springer
14 years 1 months ago
Strasheela: Design and Usage of a Music Composition Environment Based on the Oz Programming Model
Strasheela provides a means for the composer to create a symbolic score by formally describing it in a rule-based way. The environment defines a rich music representation for comp...
Torsten Anders, Christina Anagnostopoulou, Michael...
INTERSENSE
2006
ACM
14 years 1 months ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
PODS
1999
ACM
89views Database» more  PODS 1999»
14 years 14 hour ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
IJCAI
2007
13 years 9 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...