Sciweavers

8499 search results - page 292 / 1700
» cans 2009
Sort
View
LICS
2009
IEEE
16 years 1 months ago
Logical Step-Indexed Logical Relations
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
Derek Dreyer, Amal Ahmed, Lars Birkedal
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
16 years 1 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
158
Voted
WOLLIC
2009
Springer
16 years 1 months ago
Query Answering in Description Logics: The Knots Approach
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Manta...
CIE
2009
Springer
16 years 1 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
EPIA
2009
Springer
16 years 1 months ago
A Logic Programming System for Evolving Programs with Temporal Operators
Logic Programming Update Languages were proposed as an extension of logic programming that allows modeling the dynamics of knowledge bases where both extensional (facts) and intent...
José Júlio Alferes, Alfredo Gabaldon...