Titlebook: GWAI-83; 7th German Workshop Bernd Neumann Book 1983 Springer-Verlag Berlin Heidelberg 1983 artificial intelligence.expert system.knowledg

委派

Proof Search for Unprovable FormulasA method is developped of how to extend theorem provers in order to decide satisfiability for every formula of prefix type .. The key idea is to find a certain criterion for the existence of loops in the search tree. As a byproduct a result on proof complexity is derived.

Thymus

Mumble

Cupidity

綠州

temperate

癡呆

On the Use of Operation Information in Problem Solving thereby excluding detours and avoiding problems of subgoal protection. Stating operation preconditions in terms of operation instances already applied restricts access to world states to a minimum and facilitates goal directedness in planning.

Amendment

macular-edema

Cosmopolitan