Extensions of Constraint Solving for Proof Planning Extensions of Constraint Solving for Proof Planning
نویسنده
چکیده
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning beneets from the general functionalities of a constraint solver such as consistency checks, constraint inference, as well as the search for instantiations. However, oo-the-shelf constraint solvers are usually geared towards their typical applications. Since proof planning diiers from other applications, we present extensions of constraint solving necessary for its use in proof planning. We think that these extensions can broaden the range applications of constraint solving even beyond proof planning.
منابع مشابه
Extensions of Constraint Solving for Proof PlanningErica
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning beneets from the general functionalities of a constraint solver such as consistency checks, constraint inference, as well as the search for instantiations. However, oo-the-shelf constraint solvers are usually geared towards their typical applications. Since proof planning diiers from...
متن کاملExtensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver such as consistency check, constraint inference, as well as the search for instantiations. However, off-the-shelf constraint solvers need to be extended in order to be be integrated appropriately: In particular, for cor...
متن کاملApplying Lakatos-style reasoning to AI problems
Lakatos (1976) argued that mathematics develops in a much more organic way than its rigid textbook presentation of definition-theorem-proof would suggest. He outlined a heuristic approach which holds that mathematics progresses by a series of primitive conjectures, proofs, counterexamples, proof-generated concepts, modified conjectures and modified proofs. The purpose of this chapter is to appl...
متن کاملAI-Techniques in Proof Planning
Proof planning is an application of Artiicial Intelligence (AI)-planning in mathematical domains for theorem proving. The paper presents a knowledge-based proof planning approach that is implemented in the OMEGA proof planner. It evaluates control-rules in order to restrict the otherwise intractable search spaces and combines proof planning with domain-speciic constraint solving. Several AI-tec...
متن کاملDesigning Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کامل