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 scienceAsked by:milan-ransingh

Taged users:

edu-Freak

Likes:

Be first to like this question

Dislikes:

Be first to dislike this question

Talk about this Delete Like Dislike

AnswersHorn 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.

Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this Delete Like Dislike

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

You may also like our videosBelow are some of the videos from our collection. We saw that students not only needed content but also videos. So, we decided to build a video platform for you also an algorithm which shows best videos suites to you related to the content you are browsing check out some videos which suit best for you.

Lets together make the web is a better placeWe made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams"with these.Answer a question:You can answer the questions not yet answered in eduladder.How to answer a questionCareer:Work or do your internship with us.Work with usCreate a video:You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladderDonate:Ad revenue alone is not able to take care of our server cost consider donating at least a dollar Click here to donate.