579 search results - page 54 / 116 » Combined reasoning by automated cooperation |
LOPSTR
2009
Springer
14 years 3 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
ECSQARU
2007
Springer
14 years 2 months ago
2007
Springer
Based on the canonical decomposition of belief functions, Smets introduced the concept of a latent belief structure (LBS). This concept is revisited in this article. The study of t...
ELP
1991
14 years 7 days ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
EWCBR
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we propose an approach to address the old problem of identifying the feature conditions under which a gaming strategy can be effective. For doing this, we will build ...