1941 search results - page 129 / 389 » On the Hardness of Approximate Reasoning |
168
click to vote
AAAI
2007
15 years 8 months ago
2007
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
143
click to vote
OWLED
2008
15 years 7 months ago
2008
Predicting the performance of a tableau reasoner for an OWL ontology is generally hard. It is even harder for users who are not familiar with the details of tableau algorithms. In ...
182
click to vote
CL
2006
Springer
15 years 6 months ago
2006
Springer
Many software systems suffer from missing support for behavioral (runtime) composition and configuration of software components. The concern "behavioral composition and confi...
148
click to vote
DSD
2009
IEEE
16 years 1 months ago
2009
IEEE
—We present experiments with synthesis tools using examples which are currently believed to be very hard, namely the LEKU examples by Cong and Minkovich and parity examples of ou...
176
click to vote
MKM
2007
Springer
16 years 17 days ago
2007
Springer
One major goal of Mathematical Knowledge Management is building extensive repositories, in which the mathematical knowledge has been verified. It appears, however, that maintainin...