Sciweavers

2519 search results - page 239 / 504
» Reasoning with Textual Cases
Sort
View
CADE
2004
Springer
16 years 7 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
EMSOFT
2007
Springer
16 years 24 days ago
E-FRP with priorities
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...
Roumen Kaiabachev, Walid Taha, Angela Yun Zhu
TIME
2005
IEEE
16 years 6 days ago
Version Management and Historical Queries in Digital Libraries
Historical information can be effectively preserved using XML and searched through powerful historical queries written in XQuery. Indeed, by storing the successive versions of a d...
Fusheng Wang, Carlo Zaniolo, Xin Zhou, Hyun J. Moo...
ICCBR
2005
Springer
16 years 5 days ago
A Knowledge-Intensive Method for Conversational CBR
In conversational case-based reasoning (CCBR), a main problem is how to select the most discriminative questions and display them to users in a natural way to alleviate users’ co...
Mingyang Gu, Agnar Aamodt
SAT
2005
Springer
142views Hardware» more  SAT 2005»
16 years 3 days ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...