Sciweavers

1937 search results - page 308 / 388
» Rule Based Updates on Simple Knowledge Bases
Sort
View
CP
1998
Springer
15 years 8 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
ICMLA
2007
15 years 5 months ago
Learning to evaluate conditional partial plans
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
Slawomir Nowaczyk, Jacek Malec
VMV
2008
107views Visualization» more  VMV 2008»
15 years 5 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
AAAI
1994
15 years 5 months ago
Forming Beliefs about a Changing World
The situation calculus is a popular technique for reasoning about action and change. However, its restriction to a firstorder syntax and pure deductive reasoning makes it unsuitab...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
IJAR
2008
114views more  IJAR 2008»
15 years 3 months ago
A definition of subjective possibility
: Based on the setting of exchangeable bets, this paper proposes a subjectivist view of numerical possibility theory. It relies on the assumption that when an agent constructs a pr...
Didier Dubois, Henri Prade, Philippe Smets