Pseudo-models and propositional Horn inference

https://doi.org/10.1016/j.dam.2004.06.019Get rights and content
Under an Elsevier user license
open archive

Abstract

A well-known result is that the inference problem for propositional Horn formulae can be solved in linear time. We show that this remains true even in the presence of arbitrary (static) propositional background knowledge. Our main tool is the notion of a cumulated clause, a slight generalization of the usual clauses in Propositional Logic. We show that each propositional theory has a canonical irredundant base of cumulated clauses, and present an algorithm to compute this base.

MSC

03B05
03B35
68T30

Keywords

Horn inference
Horn base
Background knowledge

Cited by (0)