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

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
Ketu-in-First-House-->View question


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

in terms of logic in computer science

By: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|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!