Decision Procedure in Logic

Soundness

Definiton
DECISION PROCEDURE
A decision procedure for a logic is an algorithm that solves the
decision problem for any formula in this logic.
An algorithm that, given a decision problem, terminates with a
correct yes/no answer.
Determining in a finite number of steps the validity of any of a
certain class of propositions.

Definiton
SOUNDNESS

o Soundness refers to logical systems, which means that

if some formula can be proven in a system, then it is
true in the relevant model/structure (if A is a theorem, it
is true).
o Alogical systemhas thesoundnessproperty If and
only ifitsinference rulesprove onlyformulas that
arevalidwith respect to itssemantics.
o
o

Soundness: the answer returned by the decision

procedure is always correct.
(Question: correct according to what?)
when I say that it rains, it rains, and
when I say it
doesnt rain, it doesnt rain

Definiton
DEDUCTIVE & INDUCTIVE REASONING
o

Deductive reasoningconcerns whatfollows necessarilyfrom

given premises (ifa, thenb). A deductive argument issoundif
and only if it is both valid, and all of its premises areactually
true. Otherwise, a deductive argument isunsound.

Inductive reasoning is the process of deriving a reliable

inference from observations. It is often included in the study of
logic.

Consistency

Validity

Soundness

Completeness

UNSOUNDNESS
o Soundness/unsoundness apply only to valid arguments.
o

Its not a question of right or wrong there are still three

types of deductive arguments: invalid (and unsound);
valid and sound; valid and unsound

Logical System

Most proofs of soundness are trivial.For example, in

anaxiomatic system, proof of soundness amounts to verifying
the validity of the axioms and that the rules of inference
preserve validity (or the weaker property, truth).

Most axiomatic systems have only the rule ofmodus

ponens(and sometimes substitution) so it requires only
verifying the validity of the axioms and one rule of inference.
Soundness properties come in two main varieties: weak and
strong soundness.

Soundness Argument
Has premises that are actually TRUE in the real world.
Has reasoning that valid

Soundness Argument

BY USING:
If p, then q
p
q

If Tweety is a canary,
then Tweetys a bird.
Tweety is a canary.
Tweety is a bird.

VALID
AND SOUND

If Tweety is a bird,
a canary.
Tweety is a bird.
Tweety is a canary.

VALID
BUT NOT
SOUND

If Tweety is a canary,
then Tweetys a bird.
Tweety is a bird.
Tweety is a canary.

INVALID

Syntax
A decision procedure solves a problem with YES or NO
answers:

Sentence can be derived from the set of sentences

KB by procedure i.

SOUNDNESS : procedure i is sound: if whenever

procedure i proves that a sentence can be derived
from a set of sentences KB (KB `i ), then it is also
true that KB entails (KB |= ).

no wrong inferences are drawn

A sound procedure may fail to find the solution in
some cases, when there is actually one.

Soundness Proof Procedure

Soundness of some proof procedure P:

Example: simple proof procedure S

For each interpretation I, check whether all clauses in

KB hold

If all clauses are true, I is a model

KB S g if g holds in all such models

The simple proof procedure S is sound:

Soundness Bottom-up proof

A proof procedure P is sound if:
KB P g implies KB g.
Sound: everything it derives follows logically from KB (i.e. is
true in every model)

For soundness of bottom-up proof procedure BU:

Soundness-Lemmas Command
Ininformal logicandargument mapping, alemmais
simultaneously acontentionforpremisesbelow it and a premise
for a contention above it.

A "helping theorem orlemma(plurallemmataorlemmas)is

a provenproposition which is used as to achieve a larger result
rather than as a statement.

A lemma can be considered a minor result whose sole purpose is

to help prove a theorem a step in the direction of proof

Soundness-Lemmas Command
The first lemma proves that when an operator is applied to values
of the expected type, the result is a value whose type matches the
return type of the operator.

Lemma(issafe).
If(o,T)=Tandvi:Tifori{1,
,n},
then(o,v)=vandv:T,forsomev

Proof.Weproceedbycasesontheoperatoro.
Iftheoperatorois+,thenwehaveT1=T2=IntandT=Int.Then
becausevi:Int,weknowthatvi=nifori{1,2}.
Then(+,n1,n2)=n1+n2andwehave(n1+n2):Int.
Iftheoperatorois,thenwehaveT1=IntandT=Int.Then
becausev1:Int,weknowthatv1=nforsomen.Then(,n)=nandwe
haven:Int.
Iftheoperatorois=,thenwehaveT1=T2=IntandT=Bool.Then
becausevi:Int,weknowthatvi=nifori{1,2}.
Then(=,n1,n2)=n1=n2andwehave(n1=n2):Bool.

Comparison
COMPLETENESS

SOUNDNESS

Defined as:
if given then

Defined as:
If given then which
is
the opposite.

Completeness means that

youcanprove anything that's right.

Soundness means that

youcannotprove anything that's
wrong.

If a statement is true, then its

addressed by the logic system. But
unfortunately, not every proof is
about a true statement, but all true
statements for sure are covered

If a statement is returned from a proof

by the system, it must be true. It might
not address every possible question,
but whatever it answers, its correct.

Advantages

The system is deterministic, that is, it generates proof for a

given formula.

The system is a validity-checker, hence it check by algorithm

and a formula.
Representation within a uniform formalism for the basic
components of formal systems: syntax, semantics, and
deduction.

Application in real life

THE EXAMPLE SECTOR IN SOUNDNESS (BANK SECTOR)
The soundness use in Financial sector.
The soundness also use in the Bank Sector or also call as Bank
Soundness.
The Advantages use soundness for bank sector
That bank level can provide more databases.
Additional information compared to aggregate data used in country studies.
A drawback also applicable to the country level studies.

THE EXAMPLE SECTOR IN SOUNDNESS (AUTOMATING FOR VIRTUAL

MACHINE)
Aim soundness by using soundness is:
To increase the level of automation that applied to this problem automating
Focus one particular automated decision and particular from user guidance.
Isolate out the user guidance into component that called guided reduction to

Conclusion
As a conclusion , we have proven
that soundness of the region
calculus by using a syntatic
proof method .based on subject
reduction and progress .the
subject reduction theorem
ensures that the region type of a
valid program is pre-served
during the evaluation .This
simple soundness proof adds
confidence to our region-based
memory inference and execution
system .

References
Chaabani, M., Mezghiche, M., & Strecker, M. (2013). Formal
verification of a proof procedure for the description logic
ALC.arXiv preprint arXiv:1307.8211.

Fontaine, P., Marion, J. Y., Merz, S., Nieto, L. P., & Tiu, A.
(2006). Expressiveness+ automation+ soundness: Towards
combining SMT solvers and interactive proof assistants.
InTools and Algorithms for the Construction and Analysis of
Systems(pp. 167-181). Springer Berlin Heidelberg.

Ford, J., & Shankar, N. (2002). Formal verification of a

combination decision procedure. InAutomated Deduction
CADE-18(pp. 347-362). Springer Berlin Heidelberg.

Thanks!