Sciweavers

590 search results - page 59 / 118
» From Relational Specifications to Logic Programs
Sort
View
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 8 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
ISMIR
2004
Springer
95views Music» more  ISMIR 2004»
14 years 2 months ago
A multi-parametric and redundancy-filtering approach to pattern identification
This paper presents the principles of a new approach aimed at automatically discovering motivic patterns in monodies. It is shown that, for the results to agree with the listenerâ...
Olivier Lartillot
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
CIA
2007
Springer
14 years 3 months ago
Formal Analysis of Trust Dynamics in Human and Software Agent Experiments
Recognizing that trust states are mental states, this paper presents a formal analysis of the dynamics of trust in terms of the functional roles and representation relations for tr...
Tibor Bosse, Catholijn M. Jonker, Jan Treur, Dmytr...
CEFP
2005
Springer
14 years 2 months ago
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
Kevin Hammond