275 search results - page 28 / 55 » A Family of Defeasible Reasoning Logics and its Implementati... |
CADE
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...
ASP
2003
Springer
14 years 19 days ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
MODELS
2009
Springer
14 years 1 months ago
2009
Springer
Product line engineering is an emerging paradigm of developing a family of products. While product line analysis and design mainly focus on reasoning about commonality and variabi...
LOPSTR
2004
Springer
14 years 23 days ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
ECSQARU
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Today, different formalisms exist to solve reasoning problems under uncertainty. For most of the known formalisms, corresponding computer implementations are available. ...