265 search results - page 16 / 53 » Weakly Algebraizable Logics |
TARK
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
FSS
2010
13 years 6 months ago
2010
In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of co...
ISCC
2006
IEEE
14 years 2 months ago
2006
IEEE
Network resource management and control is a complex problem that requires robust, possibly intelligent, control methodologies to obtain satisfactory performance. While many Activ...
ILP
2004
Springer
14 years 2 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...