Sciweavers

764 search results - page 98 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
AAAI
1992
15 years 1 months ago
Lexical Imprecision in Fuzzy Constraint Networks
We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which ...
James Bowen, K. Robert Lai, Dennis Bahler
ICFP
2010
ACM
15 years 27 days ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
PEPM
2009
ACM
15 years 8 months 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
LICS
2009
IEEE
15 years 6 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
AGP
2003
IEEE
15 years 5 months ago
Reasoning about the Semantic Web using Answer Set Programming
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...
Giovambattista Ianni, Francesco Calimeri, Vincenzi...