منابع مشابه
Semantically Guided Mega Proof Planner Semantically Guided Mega Proof Planner
Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning takes a diierent perspective and uses semantic information as search control heuristics. In thi...
متن کاملExploiting Competitive Planner Performance
To date, no one planner has demonstrated clearly superior performance. Although researchers have hypothesized that this should be the case, no one has performed a large study to test its limits. In this research, we tested performance of a set of planners to determine which is best on what types of problems. The study included six planners and over 200 problems. We found that performance, as me...
متن کاملic Instructional Planner
model or time remaining. The planner is designed to be generic to tutors that teach troubleshooting for complex physical devices. It controls the Lower Hoist Tutor, a prototype tutor for the Mark-45 naval gun mount. This tutor teaches troubleshooting of the lower hoist, a complex hydraulic-electronic-mechanical assembly of the Mark-45 The tutor implementation demonstrates the planner’s operatio...
متن کاملIntent Inferencer-Planner Interactions
Interaction between automated planners and intent inferencers is a difficult problem that is not always well understood. This problem can be framed in terms of a number of key issues: shared ontology, human interaction, and display of proposals. Shared ontology is a key issue from both practical and theoretical perspectives. Without sharing, intent inference outputs must be interpreted by the p...
متن کاملWorldwide Aeronautical Route Planner
We consider the common problem of calculating routes from a starting point to a destination through a given space. This process typically involves discretizing the navigational space into a graph of intermediate waypoints linked together through transitions. A search for a solution that fits desired criteria can then be performed. Typical criteria include: minimum distance, minimum transit time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Questiones publicitarias
سال: 2004
ISSN: 1988-8732,1133-6870
DOI: 10.5565/rev/qp.180