925 search results - page 169 / 185 » Probabilistic Belief Logics |
JCST
2010
13 years 5 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
FMCAD
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
ECAI
2000
Springer
14 years 3 months ago
2000
Springer
Several high-level programming languages for programming agents and robots have been proposed in recent years. Each of these languages has its own features and merits. It is still...
FSKD
2006
Springer
14 years 2 months ago
2006
Springer
The purpose of this study is to develop a decision making system to evaluate the risks in E-Commerce (EC) projects. Competitive software businesses have the critical task of assess...
AAAI
1993
14 years 3 days ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...