Sciweavers

590 search results - page 27 / 118
» From Relational Specifications to Logic Programs
Sort
View
HASKELL
2006
ACM
14 years 2 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
IFIP
2005
Springer
14 years 2 months ago
Relative Trustworthiness
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
Johan W. Klüwer, Arild Waaler
GEOS
2005
Springer
14 years 2 months ago
A Qualitative Trajectory Calculus and the Composition of Its Relations
Continuously moving objects are prevalent in many domains. Although there have been attempts to combine both spatial and temporal relationships from a reasoning, a database, as wel...
Nico Van de Weghe, Bart Kuijpers, Peter Bogaert, P...
LPKR
1997
Springer
14 years 27 days ago
A System for Abductive Learning of Logic Programs
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
WCFLP
2005
ACM
14 years 2 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal