4573 search results - page 231 / 915 » Automated Reasoning |
170
click to vote
SARA
2007
Springer
16 years 21 days ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
165
click to vote
IJCAI
1997
15 years 8 months ago
1997
A method is presented for analogical reasoning in Automated Deduction. We focus on the abductive aspects of analogy and give a unified treatment for theorems and non-theorems. Abd...
165
click to vote
GI
2004
Springer
15 years 12 months ago
2004
Springer
Abstract: The goals of organic computing are difficult to achieve due to the heterogenity of current software components. We believe that in the long term more advanced software a...
198
click to vote
DLOG
2011
14 years 10 months ago
2011
Abstract. The pressing need for scalable query answering has motivated the development of many incomplete ontology-based reasoners. Improving the completeness of such systems witho...
214
click to vote
DLOG
2009
15 years 4 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...