Koriche, F. (1998), Approximate reasoning about combined knowledge. In Intelligent Agents IV, Singh M.P, Rao, A. and Wooldridge, M.J. (Eds.), Springer Verlag.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Full Lifecycle Methodologies for Agent-Oriented Systems .. - Debenham.. (2002) (1 citation) (Correct)
....for poor performers to improve and balancing workload. Payoff is defined by the user and could be some combination of the expected value added to the process, the expected time and or cost to deal with the process, and the expected likelihood of the process leading to a satisfactory conclusion [24]. Assessment The applications built are distributed multiagent systems. This enables the management of complex tasks to be handled as each node is individually responsible for the way in which it goes about its business. That is, the plan in each agent only has to deal with the goals that that ....
Koriche, F. (1998), Approximate reasoning about combined knowledge. In Intelligent Agents IV, Singh M.P, Rao, A. and Wooldridge, M.J. (Eds.), Springer Verlag.
Supporting Knowledge-Driven Processes in a Multiagent.. - John Debenham University (2000) (Correct)
....for poor performers to improve and balancing workload. Payoff is defined by the user and could be some combination of the expected value added to the process, the expected time and or cost to deal with the process, and the expected likelihood of the process leading to a satisfactory conclusion [14]. The system provides assistance to the user by suggesting how delegation could be performed using a method that the user has specified in terms of the tools described below. The user can opt to let the system delegate automatically, or can opt to delegate manually. Given a sub process, suppose ....
Koriche, F. "Approximate Reasoning about Combined Knowledge" in Intelligent Agents IV, Singh M.P, Rao, A. and Wooldridge, M.J. (Eds), Springer Verlag, 1998
"Adaptive Plans for Business Process Control" - John Debenham School (Correct)
....are to be avoided if possible; they waste time and resources and may annoy those who use the system. So in process computing the choice of the best path is closely related to the path that has the greatest likelihood of overall success. These likelihoods are derived from actual plan performance [12]. An estimate of the likelihood of success could be expressed in terms of a probability distribution. Any attempt to estimate a precise probability distribution in a process application will be hampered by the variations in performance due to human foibles. If the behaviour of the users is in any ....
Koriche, F. (1998): "Approximate Reasoning about Combined Knowledge" in Intelligent Agents IV, Singh M.P, Rao, A. and Wooldridge, M.J. (Eds) (Springer Verlag)
A Logic for Anytime Deduction and Anytime Compilation - Koriche (1998) Self-citation (Koriche) (Correct)
.... S 1 and S 3 , which are respectively unsound but complete and sound but incomplete with respect to classical entailment. Several extensions of this framework have been proposed in the domains of non monotonic logics [3] diagnostic reasoning [22] and reasoning in presence of inconsistency [9, 10]. The second approach is concerned by preprocessing a knowledge base into an appropriate data structure which is used for query answering. The goal here is to invest computational resources in the preprocessing effort which will later substantially speed up query answering, in the expectation ....
....all computations from scratch. The correct choice of S is crucial for the usefulness of deduction. Taking to the extreme, when S is chosen incorrectly, anytime deduction may end up as expensive as classical deduction. From this perspective, several heuristics have been proposed in the literature [6, 9, 10, 22]. For example, in a resolution based algorithm, the atoms of S may be dynamically chosen using the minimal diversity heuristic advocated in [6] The diversity of an atom p is the product of the number of positive occurrences by the number of negative occurrences of p in the theory. This notion is ....
[Article contains additional citation context not shown here]
F. Koriche. Approximate reasoning about combined knowledge. In M. P. Singh, A. S. Rao, and M. J. Wooldridge, editors, Intelligent Agents Volume IV, volume 1365 of Lecture Notes in Artificial Intelligence, pages 259--273. Springer Verlag, Berlin, Germany, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC