4617 search results - page 417 / 924 » Automation of Diagrammatic Reasoning |
172
click to vote
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
How to endow case-based reasoning systems with effective case adaptation capabilities is a classic problem. A significant impediment to developing automated adaptation procedures i...
182
click to vote
DLOG
2003
15 years 8 months ago
2003
In this short position paper, the project of building intelligent business information infrastructure using semantic web, ontology, description logics, and other related knowledge...
171
click to vote
ICCBR
2010
Springer
15 years 5 months ago
2010
Springer
The need for automated text evaluation is common to several AI disciplines. In this work, we explore the use of Machine Translation (MT) evaluation metrics for Textual Case Based R...
189
click to vote
CADE
2004
Springer
16 years 5 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
157
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...