On functional dependencies in q-Horn theories

Artificial Intelligence

Volumn 131, Issue 1-2, 2001, Pages 171-187

  Ibaraki, Toshihide ^a   Kogan, Alexander ^b,c   Makino, Kazuhisa ^d  

^a KYOTO UNIVERSITY   (Japan)

^b RUTGERS UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

^d OSAKA UNIVERSITY   (Japan)

Author keywords

Computational complexity; Condensation; Conjunctive normal form; Functional dependency; Knowledge representation; q Horn theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; RELATIONAL DATABASE SYSTEMS;

KNOWLEDGE CONDENSATIONS;

KNOWLEDGE REPRESENTATION;

EID: 0035450697     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00118-7     Document Type: Article

References (40)

1. Dependency structures of database relationships
2. A linear-time algorithm for testing the truth of certain quantified Boolean formulas
3. Polynomial time inference of all valid implications for Horn and related formulae
4. A complexity index for satisfiability problems
5. Horn minimization by iterative decomposition
6. Recognition of q-Horn formulae in linear time
7. On renamable Horn and generalized Horn functions
8. Structure identification in relational data
9. Linear time algorithms for testing the satisfiability of propositional Horn formulae
10. Equational characterizations of Boolean function classes
11. Functional dependencies in a relational database and propositional logic
12. Polynomially solvable satisfiability problems
13. Horn functions and their DNFs
14. Optimal compression of propositional Horn knowledge bases: Complexity and approximation
15. Quasi-acyclic propositional Horn knowledge bases: Optimal compression
16. Essential and redundant rules in Horn knowledge bases
17. On sentences which are true of direct unions of algebras
18. Functional dependencies in Horn theories
19. Inferring minimal functional dependencies in Horn and q-Horn theories
20. Horn approximations of empirical data
21. Forming concepts for fast inference
22. On Horn envelopes and hypergraph transversals
23. Translating between Horn representations and their characteristic models
24. Reasoning with examples: Propositional formulae and database dependencies
25. Reasoning with models
26. On generalized Horn formulas and k-resolution
27. Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs
28. Investigations on autark assignments
29. Renaming a set of clauses as a Horn set
30. Algorithms for inferring functional dependencies
31. The decision problem for some classes of sentences without quantifiers
32. LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
33. The unique Horn-satisfiability problem and quadratic Boolean equations
34. Hierarchies of polynomially solvable satisfiability problems
35. Knowledge compilation and theory approximation
36. A short note on some tractable cases of the satisfiability problem
37. Realization of Boolean functions with a small number of zeros by disjunctive normal forms and related problems