Horn-satisfiability
id:
horn-satisfiability-197-15498617
title:
Horn-satisfiability
text:
In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given set of propositional Horn clauses is satisfiable or not. Horn-satisfiability and Horn clauses are named after Alfred Horn. A Horn clause is a clause with at most one positive literal, called the head of the clause, and any number of negative literals, forming the body of the clause. A Horn formula is a propositional formula formed by conjunction of Horn clauses. Horn satisfiability is actually one of the
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Horn-satisfiability
date created:
date modified:
2024-03-06T10:50:46Z
main entity:
{"identifier":"Q1239194","url":"https://www.wikidata.org/entity/Q1239194"}
image:
fields total:
13
integrity:
13