1404 search results - page 101 / 281 » Complexity of admissible rules |
ICLP
2003
Springer
14 years 2 months ago
2003
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
LPAR
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
ASAP
1996
IEEE
14 years 1 months ago
1996
IEEE
The Alpha language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures ...
KDD
1994
ACM
14 years 1 months ago
1994
ACM
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
AUSAI
2003
Springer
14 years 21 days ago
2003
Springer
This paper introduces a new method for the rapid development of complex rule bases involving cue phrases for the purpose of classifying text segments. The method is based on Ripple...