579 search results - page 26 / 116 » Combined reasoning by automated cooperation |
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
JUCS
2007
13 years 8 months ago
2007
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...
ICST
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...
DAC
2004
ACM
14 years 9 months ago
2004
ACM
ion Refinement by Controllability and Cooperativeness Analysis Freddy Y.C. Mang and Pei-Hsin Ho Advanced Technology Group, Synopsys, Inc. {fmang, pho}@synopsys.com nt a new abstrac...
ASWC
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...