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.

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

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

A resolution calculus for SL<br />

Given be a set M of clauses of the form<br />

A ∨ ¬B ∨ C ∨ . . . ∨ ¬E<br />

Such a clause is also written as the set<br />

{A, ¬B, C, . . . , ¬E}.<br />

We define the following inference rule:<br />

Definition 6.17 (SL resolution)<br />

Deduce the clause C 1 ∪ C 2 from C 1 ∪ {A} and C 2 ∪ {¬A}.<br />

Question:<br />

Is this calculus correct and complete?

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

Saved successfully!

Ooh no, something went wrong!