27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

of. Dr. Jürgen Dix · Department of Informatics, TUC <strong>Multiagent</strong> <strong>Systems</strong>, WS 06/07 459/731<br />

6. Propositional Logic 4. Calculi for SL<br />

Answer:<br />

No!<br />

But every problem of the kind “T |= φ” is equivalent to<br />

“T ∪ {¬φ} is unsatisfiable”<br />

or rather to<br />

T ∪ {¬φ} ⊢ □<br />

(⊢ stands for the calculus introduced above).<br />

Theorem 6.18 (Completeness of Resolution Refutation)<br />

If M is an unsatisfiable set of clauses then the empty clause<br />

□ can be derived from M using only the resolution rule.<br />

We also say that resolution is refutation complete.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!