Sciweavers

5055 search results - page 21 / 1011
» Relative Timing
Sort
View
IJCAI
1989
13 years 9 months ago
Managing Efficiently Temporal Relations Through Indexed Spanning Trees
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou­ sand time-tokens in demanding applications su...
Malik Ghallab, A. Mounir Alaoui
TAP
2008
Springer
153views Hardware» more  TAP 2008»
13 years 8 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
DLOG
2011
12 years 12 months ago
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
Eufemia Tinelli, Francesco M. Donini, Michele Ruta...
CSDA
2006
191views more  CSDA 2006»
13 years 8 months ago
Forecasting daily time series using periodic unobserved components time series models
We explore a periodic analysis in the context of unobserved components time series models that decompose time series into components of interest such as trend, seasonal and irregu...
Siem Jan Koopman, Marius Ooms
ESA
2009
Springer
74views Algorithms» more  ESA 2009»
14 years 3 months ago
On Inducing Polygons and Related Problems
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc ...