2253 search results - page 301 / 451 » The ComFoRT Reasoning Framework |
CSL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
ILP
2001
Springer
14 years 1 months ago
2001
Springer
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...
CL
2000
Springer
14 years 1 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
FMLDO
1999
Springer
14 years 1 months ago
1999
Springer
Federated transaction management (also known as multidatabase transaction management in the literature) is needed to ensure the consistency of data that is distributed across mult...
AUSAI
1998
Springer
14 years 1 months ago
1998
Springer
Agent-based computing in Arti cial Intelligence has given rise to a number of diverse and competing proposals for agent programming languages. Agents, in the sense we are using it...