7167 search results - page 705 / 1434 » Answer Set Programming |
193
click to vote
TCS
2010
15 years 1 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
169
click to vote
CISIS
2010
IEEE
16 years 2 months ago
2010
IEEE
—This paper presents a qualitative logic-based method for the steady-state analysis and revision of metabolic networks with inhibition. The approach is able to automatically revi...
185
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
152
click to vote
DATE
2005
IEEE
16 years 22 days ago
2005
IEEE
Structural testing techniques, such as statement and branch coverage, play an important role in improving dependability of software systems. However, finding a set of tests which...
181
click to vote
ISIPTA
2005
IEEE
16 years 21 days ago
2005
IEEE
A protocol for the elicitation of imprecise probabilities based on linear programming is applied to the case of two continuous variables. Two medical experts were elicited. The re...