Klaus et al,
I understand there are different ways to define 'abduction'. Here, I was
using a 'naive' distinction from deduction, where one might run it as:
Given Q;
Knowing that P implies or causes or results in Q;
then P is one possible explanation or cause or requirement of Q.
I'm intentionally not using symbols like '->' to stay away from formal/logical
connotations they might carry to some.
Cheers.
Fil
Klaus Krippendorff wrote:
> filippo,
>
> i am not sure about the involvement of abductive reasoning. it depends on
> whose definition of abduction you adopt.
>
> the solving of tame problems is much indebted to solving problems in
> mathematics (see polya). you have a set of axioms and proven theorems
> (analogue to knowledge of the current world). you have a conjecture (a
> hypothetical future world or state thereof), and the problem consists of
> finding a proof which is an acceptable way to go from axioms and/or proven
> theorems to the conjecture -- with the aesthetic criterion of finding the
> minimum number of steps. If the minimum is found, it is called an elegant
> proof. if there is no proof it remains a conjecture. if there is a proof
> that the conjecture is untrue, it suggests that the conjecture is not part
> of the system (the future is inconsistent with or cannot be realized from
> the current world)
>
> klaus
>
> -----Original Message-----
> From: PhD-Design - This list is for discussion of PhD studies and related
> research in Design [mailto:[log in to unmask]] On Behalf Of Filippo
> A. Salustri
> Sent: Tuesday, April 17, 2007 11:12 AM
> To: [log in to unmask]
> Subject: Re: Wicked Problems, Tame Problems
>
> Klaus et al,
>
> 'Selecting one of many possible solutions' makes me think of abductive
> reasoning. I haven't had the time to read Rittel's papers yet, but I
> thought I'd pitch it out. Could he be talking about something that's
> sympathetic with abductive reasoning?
>
> Cheers.
> Fil
>
>
> Klaus Krippendorff <[log in to unmask]> wrote:
>> chris and terry:
>>
>> i think one can be more precise with these distinctions
>>
>> according to rittel, tame problems are solved when one has selected
>> one (the
>> optimal) solution from an enumerable set of possible solutions,
>> satisfying the criterion.
>
>
> --
> Prof. Filippo A. Salustri, Ph.D., P.Eng.
> Department of Mechanical and Industrial Engineering
> Ryerson University Tel: 416/979-5000 x7749
> 350 Victoria St. Fax: 416/979-5265
> Toronto, ON email: [log in to unmask]
> M5B 2K3 Canada http://deseng.ryerson.ca/~fil/
>
--
Prof. Filippo A. Salustri, Ph.D., P.Eng.
Department of Mechanical and Industrial Engineering
Ryerson University Tel: 416/979-5000 x7749
350 Victoria St. Fax: 416/979-5265
Toronto, ON email: [log in to unmask]
M5B 2K3 Canada http://deseng.ryerson.ca/~fil/
|