Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas

Authors:
Emmanuel Benoist; Jean-Jacques Hébrard
Affiliations:
Computer Science Department, Biel School of Engineering, Quellegasse 21, CH-2501 Biel, Switzerland E-mail:;Département d'Informatique, Université de Caen, F-14032 Caen cedex, France E-mail:
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2003

Citing 9
Cited 0

Data structures and network algorithms

Data structures and network algorithms
On generating all maximal independent sets

Information Processing Letters
Extended Horn sets in propositional logic

Journal of the ACM (JACM)
A hierarchy of tractable satisfiability problems

Information Processing Letters
On finding solutions for extended Horn formulas

Information Processing Letters
The arborescence-realization problem

Discrete Applied Mathematics
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem

A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem

Quantified Score

Hi-index	0.00

Visualization

Abstract

The enlarged Horn formulas generalize the extended Horn formulas introduced by Chandru and Hooker (1991). Their satisfying truth assignments can be generated with polynomial delay. Unfortunately no polynomial algorithm is known for recognizing enlarged Horn formulas or extended Horn formulas. In this paper we define the class of simple enlarged Horn formulas, a subclass of the enlarged Horn formulas, that contains the simple extended Horn formulas introduced by Swaminathan and Wagner (1995). We present recognition algorithms for the simple enlarged Horn formulas and the simple extended Horn formulas whose complexity is bounded by the complexity of the arborescence-realization problem.