See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

## Explain the terms horn clauses and satisfiability in terms of logic in computer science.

in terms of logic in computer scienceBy:milan-ransingh

Taged users:

|edu-Freak

Likes:

Be first to like this question

Dislikes:

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

## Answers

Horn formulas are conjunctions of Horn clauses.

Horn clause is an implication whose assumption A is a conjunction of proposition of type P and whose conclusion is also of type

A formula is a Horn formula if it is in CNF and every disjunction contains at most one positive literal.

Horn clauses are clauses, which contain at most one positive literal.

Horn formula allows to efficiently compute **satisfiability**.

If a set of formulas is not satisfiable there is a contradiction / inconsistency in the rules.

Useful to build a knowledge base.

tarun101

Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

------------------------------------

## Use Me ?