Sciweavers

1000 search results - page 110 / 200
» An RDF Query Language based on Logic Programming
Sort
View
TCS
2011
14 years 12 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
163
Voted
EVOW
1994
Springer
15 years 9 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay
DBPL
2007
Springer
136views Database» more  DBPL 2007»
15 years 11 months ago
Analysis of Imperative XML Programs
The widespread adoption of XML has led to programming languages that support XML as a first class construct. In this paper, we present a method for analyzing and optimizing impera...
Michael G. Burke, Igor Peshansky, Mukund Raghavach...
146
Voted
KR
2004
Springer
15 years 10 months ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka
IPPS
2000
IEEE
15 years 9 months ago
Declarative Concurrency in Java
We propose a high-level language based on rst order logic for expressing synchronization in concurrent object-oriented programs. The language allows the programmer to declaratively...
Rafael Ramirez, Andrew E. Santosa