Sciweavers

4940 search results - page 131 / 988
» On the Complexity of Universal Programs
Sort
View
VAMOS
2008
Springer
15 years 6 months ago
How complex is my Product Line? The case for Variation Point Metrics
Software Product Lines aim at capturing the variability and commonality of a family of related programs that share a common set of assets. Variation points capture variability on ...
Roberto E. Lopez-Herrejon, Salvador Trujillo
AI
2002
Springer
15 years 4 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
JAIR
2011
123views more  JAIR 2011»
14 years 11 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
VMCAI
2010
Springer
16 years 1 months ago
Complexity Bounds for the Verification of Real-Time Software
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
ICSM
2002
IEEE
15 years 9 months ago
Atomic Architectural Component Recovery for Program Understanding and Evolution
Component recovery and remodularization is a means to get back control on large and complex legacy systems suffering from ad-hoc changes by recovering logical components and restr...
Rainer Koschke