Sciweavers

1966 search results - page 199 / 394
» Description Logics and Planning
Sort
View
SEBD
2001
145views Database» more  SEBD 2001»
15 years 8 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
BIRTHDAY
2010
Springer
15 years 7 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
INTERNET
2007
105views more  INTERNET 2007»
15 years 6 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao
CADE
2009
Springer
16 years 1 months ago
SPASS Version 3.5
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
Christoph Weidenbach, Dilyana Dimova, Arnaud Fietz...
LICS
2007
IEEE
16 years 24 days ago
Resource modalities in game semantics
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is...
Paul-André Melliès, Nicolas Tabareau