Sciweavers

2162 search results - page 230 / 433
» Automated Reasoning on Feature Models
Sort
View
LPNMR
2005
Springer
16 years 15 hour 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 8 hour 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, ...
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
16 years 3 hour 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
DEON
2004
Springer
15 years 12 months ago
Specifying Multiagent Organizations
Abstract. In this paper we investigate the specification and verification of information systems with an organizational structure. Such systems are modelled as a normative multia...
Leendert W. N. van der Torre, Joris Hulstijn, Mehd...
NMR
2004
Springer
15 years 12 months ago
A possibilistic approach to restore consistency in answer set programming
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
Pascal Nicolas, Laurent Garcia, Igor Stépha...