Sciweavers

3856 search results - page 446 / 772
» Models for Automated Earthmoving
Sort
View
LPNMR
2005
Springer
16 years 6 days ago
Testing Strong Equivalence of Datalog Programs - Implementation and Examples
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
Thomas Eiter, Wolfgang Faber, Patrick Traxler
LPNMR
2005
Springer
16 years 6 days ago
Inference of Gene Relations from Microarray Data by Abduction
We describe an application of Abductive Logic Programming (ALP) to the analysis of an important class of DNA microarray experiments. We develop an ALP theory that provides a simple...
Irene Papatheodorou, Antonis C. Kakas, Marek J. Se...
PPSWR
2005
Springer
16 years 6 days ago
A General Language for Evolution and Reactivity in the Semantic Web
Abstract. In this paper we define the basic concepts for a general language for evolution and reactivity in the Semantic Web. We do this by exposing an UML model that specifies a...
José Júlio Alferes, Ricardo Amador, ...
PPSWR
2005
Springer
16 years 6 days ago
A Revised Architecture for Semantic Web Reasoning
The current architecture for the Semantic Web, with its emphasis on RDF syntactic and semantic compatability, has severe problems when expressive Semantic Web languages are incorpo...
Peter F. Patel-Schneider
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
16 years 6 days ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko