4573 search results - page 742 / 915 » Automated Reasoning |
128
Voted
CSL
2004
Springer
15 years 8 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
119
Voted
FUZZIEEE
2007
IEEE
15 years 9 months ago
2007
IEEE
— The application of Qualitative Reasoning to Learning Algorithms can provide these models with the capability of automate common-sense and expert reasoning. Learning algorithms ...
131
click to vote
CHI
2008
ACM
16 years 3 months ago
2008
ACM
In this paper, we describe an innovative tool that supports the design and evaluation of the information architecture of a Web site. The tool uses Latent Semantic Analysis and hie...
117
Voted
MICAI
2000
Springer
15 years 7 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
99
Voted
ISPW
2009
IEEE
15 years 10 months ago
2009
IEEE
It is usual for work completed at one point in a software development process to be revisited, or reworked, at a later point. Such rework is informally understood, but if we hope t...