Sciweavers

1776 search results - page 192 / 356
» Using a Logic Programming Language with Persistence and Cont...
Sort
View
136
Voted
ESWS
2007
Springer
15 years 9 months ago
A Reasoning Framework for Rule-Based WSML
WSML is an ontology language specifically tailored to annotate Web Services, and part of its semantics adheres to the rule-based knowledge representation paradigm of logic program...
Stephan Grimm, Uwe Keller, Holger Lausen, Gá...
123
Voted
PEPM
2009
ACM
16 years 13 days ago
Program transformation for numerical precision
This article introduces a new program transformation in order to enhance the numerical accuracy of floating-point computations. We consider that a program would return an exact r...
Matthieu Martel
125
Voted
CL
2000
Springer
15 years 8 months ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
192
Voted
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 13 days ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
PEPM
2004
ACM
15 years 9 months ago
Proving termination of membership equational programs
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
Francisco Durán, Salvador Lucas, José...