Sciweavers

1650 search results - page 273 / 330
» The HOM problem is decidable
Sort
View
LOGCOM
2007
91views more  LOGCOM 2007»
13 years 8 months ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
FUIN
2000
71views more  FUIN 2000»
13 years 8 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
ESE
2002
112views Database» more  ESE 2002»
13 years 8 months ago
An Empirical Method for Selecting Software Reliability Growth Models
Estimating remaining defects or failures in software can help test managers make release decisions during testing. Several methods exist to estimate defect content, among them a v...
Catherine Stringfellow, Anneliese Amschler Andrews
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
13 years 8 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila
INFSOF
2002
153views more  INFSOF 2002»
13 years 8 months ago
Analyzing cloning evolution in the Linux kernel
Identifying code duplication in large multi-platform software systems is a challenging problem. This is due to a variety of reasons including the presence of high-level programmin...
Giuliano Antoniol, Umberto Villano, Ettore Merlo, ...