2214 search results - page 249 / 443 » Complexity of Reasoning |
230
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
147
Voted
CHI
2009
ACM
16 years 4 months ago
2009
ACM
Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI ...
157
Voted
CAV
2009
Springer
16 years 4 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
113
Voted
OSDI
2004
ACM
16 years 4 months ago
2004
ACM
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
121
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
2008
IEEE-ACM
Variability modelling with feature models is one key technique for specifying the problem space of Software Product Lines (SPLs). To allow for the automatic derivation of a concre...