|on definition of soundness and completeness email@example.com (Bin Xin) (2009-06-23)|
|Re: on definition of soundness and completeness firstname.lastname@example.org (Gene) (2009-07-05)|
|Re: on definition of soundness and completeness email@example.com (gopi) (2009-07-16)|
|Date:||Thu, 16 Jul 2009 22:26:00 -0700 (PDT)|
|Posted-Date:||17 Jul 2009 14:41:45 EDT|
> Soundness property (of F) can be claimed when: F \vdash P \implies I
> \models P.
> and conversely,
> Completeness property (of F) can be claimed when: I \models P \implies
> F \vdash
This agrees with the concepts of soundness and completeness I am
familiar with. Going back to basics, When the formal system is an
algorithm, this translates to something like this in simple english:
An algorithm is said to be sound if for every problem P, every
solution the algorithm finds is a correct solution.
An algorithm is said to be complete if for every problem P, if a
solution exists, the algorithm will find it (in finite time).
These are fairly important properties (for example in the AI
Planning / Planner space), and I will be surprised if any one gets
them wrong !
Sankhya Technologies Private Limited
Mobile: +91 94408 78042
Return to the
Search the comp.compilers archives again.