Sciweavers

498 search results - page 68 / 100
» A Formal Foundation for ODRL
Sort
View
ACL
2010
14 years 8 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
KCAP
2005
ACM
15 years 3 months ago
An ontological approach to the construction of problem-solving models
Our ongoing work aims at defining an ontology-centered approach for building expertise models for the CommonKADS methodology. This approach (which is named "OntoKADS") i...
Sabine Bruaux, Gilles Kassel, Gilles Morel
CCA
2005
Springer
15 years 3 months ago
The Dedekind Reals in Abstract Stone Duality
kind Reals in Abstract Stone Duality Andrej Bauer and Paul Taylor 3 June 2009 Stone Duality (ASD) is a direct axiomatisation of general topology, in contrast to the traditional an...
Andrej Bauer, Paul Taylor 0002
IWPSE
2003
IEEE
15 years 3 months ago
Using Coordination Contracts for Flexible Adaptation to Changing Business Rules
This paper reports on the use of coordination contracts, presented at the previous two IWPSE workshops, in a project for a credit recovery company. We have designed and implemente...
Michel Wermelinger, Georgios Koutsoukos, Richard A...
ICALP
1997
Springer
15 years 2 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz