Add to ORKGHorn formulas make up an important subclass of Boolean formulas that exhibits interesting and useful computational properties. They have been widely studied due to the fact that the satisfiability problem for Horn formulas is solvable in linear time. Also resulting from this, Horn formulas play an important role in the field of artificial intelligence. The minimization problem of Horn formulas is to reduce the size of a given Horn formula to find a shortest equivalent representation. Many knowledge bases in propositional expert systems are represented as Horn formulas. Therefore the minimization of Horn formulas can be used to reduce the size of these knowledge bases, thereby increasing the efficiency of queries. The goal of this project ...
AbstractNew algorithms for deciding whether a (propositional) Horn formula is satisfiable are presen...
AbstractIn this paper the class of mixed Horn formulas is introduced that contain a Horn part and a ...
AbstractIn this paper we study several classes of Boolean formulae which generalize Horn formulae wh...
Horn formulas make up an important subclass of Boolean formulas that exhibits interesting and useful...
One of the recently most studied subsets of Boolean functions are Horn functions. There is quite a l...
. The problem of Horn minimization can be stated as follows: given a Horn CNF representing a Boolean...
Selman and Kautz proposed a method, called Horn approximation, for speeding up inference in proposit...
AbstractSelman and Kautz proposed a method, called Horn approximation, for speeding up inference in ...
Boolean formulas can be used to model real-world facts. In some situation we may havea Boolean formu...
Boolean formulas can be used to model real-world facts. In some situation we may havea Boolean formu...
Horn functions form a subclass of Boolean functions and appear in many different areas of computer s...
AbstractSelman and Kautz proposed a method, called Horn approximation, for speeding up inference in ...
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper ...
In a recent study Selman and Kautz proposed a method, called Horn approximation, for speeding up inf...
The class q-Horn, introduced by Boros, Crama and Hammer in 1990, is one of the largest known classes...
AbstractNew algorithms for deciding whether a (propositional) Horn formula is satisfiable are presen...
AbstractIn this paper the class of mixed Horn formulas is introduced that contain a Horn part and a ...
AbstractIn this paper we study several classes of Boolean formulae which generalize Horn formulae wh...
Horn formulas make up an important subclass of Boolean formulas that exhibits interesting and useful...
One of the recently most studied subsets of Boolean functions are Horn functions. There is quite a l...
. The problem of Horn minimization can be stated as follows: given a Horn CNF representing a Boolean...
Selman and Kautz proposed a method, called Horn approximation, for speeding up inference in proposit...
AbstractSelman and Kautz proposed a method, called Horn approximation, for speeding up inference in ...
Boolean formulas can be used to model real-world facts. In some situation we may havea Boolean formu...
Boolean formulas can be used to model real-world facts. In some situation we may havea Boolean formu...
Horn functions form a subclass of Boolean functions and appear in many different areas of computer s...
AbstractSelman and Kautz proposed a method, called Horn approximation, for speeding up inference in ...
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper ...
In a recent study Selman and Kautz proposed a method, called Horn approximation, for speeding up inf...
The class q-Horn, introduced by Boros, Crama and Hammer in 1990, is one of the largest known classes...
AbstractNew algorithms for deciding whether a (propositional) Horn formula is satisfiable are presen...
AbstractIn this paper the class of mixed Horn formulas is introduced that contain a Horn part and a ...
AbstractIn this paper we study several classes of Boolean formulae which generalize Horn formulae wh...