An efficient algorithm for Horn description

Information Processing Letters

Volumn 88, Issue 4, 2003, Pages 177-182

  Hébrard, Jean Jacques ^a   Zanuttini, Bruno ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

Algorithms; Combinatorial problems; Description; Horn CNF

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMBINATORIAL PROBLEMS;

DATA PROCESSING;

EID: 16744366443     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.06.001     Document Type: Article

References (9)

1. Aho A., Hopcroft J., Ullman J. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading, MA.
2. Angluin D., Frazier M., Pitt L. Learning conjunctions of Horn clauses. Machine Learning. 9:1992;147-164.
3. Dechter R., Pearl J. Structure identification in relational data. Artificial Intelligence. 58:1992;237-270.
4. Hammer P.L., Kogan A. Optimal compression of prepositional Horn knowledge bases: complexity and approximation. Artificial Intelligence. 64:1993;131-145.
5. Kavvadias D., Papadimitriou C.H., Sideri M. On Horn envelopes and hypergraph transversals (extended abstract). Proc. 4th Internat. Symp. on Algorithms and Computation (ISAAC'93). Springer Lecture Notes in Computer Science. 762:1993;399-405 Springer, Berlin.
6. Kavvadias D., Sideri M. The inverse satisfiability problem. SIAM J. Comput. 28:(1):1998;152-163.
7. McKinsey J. The decision problem for some classes of sentences without quantifiers. J. Symbolic Logic. 8:1943;61-77.
8. Schaefer T.J. The complexity of satisfiability problems. Proc. 10th Annual ACM Symp. on Theory of Computing (STOC'78). 1978;216-226 ACM Press, New York.
9. Zanuttini B., Hébrard J.-J. A unified framework for structure identification. Inform. Process. Lett. 81:(6):2002;335-339.