Pseudo-models and propositional Horn inference

Discrete Applied Mathematics

Volumn 147, Issue 1, 2005, Pages 43-55

  Ganter, Bernhard ^a   Krauße, Rüdiger ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Background knowledge; Horn base; Horn inference

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; DATABASE SYSTEMS; INFERENCE ENGINES; KNOWLEDGE ACQUISITION; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

BACKGROUND KNOWLEDGE; HORN BASE; HORN INFERENCE; PSEUDO-MODELS;

PROBLEM SOLVING;

EID: 13444256100     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.06.019     Document Type: Article

References (10)

1. W.F. Dowling, and J.H. Gallier Linear-time algorithms for testing the satisfiability of propositional Horn formulae J. Logic Programming 3 1984 267 284
2. B. Ganter, Two basic algorithms in concept analysis, FB4-Preprint no. 831, TH Darmstadt, 1984.
3. B. Ganter Attribute exploration with background knowledge Theoret. Comput. Sci. 217 1999 215 233
4. B. Ganter, and R. Wille Formal Concept Analysis - Mathematical Foundations 1999 Springer Berlin, Heidelberg
5. J.-L. Guigues, and V. Duquenne Familles minimales d'implications informatives resultant d'un tableau de données binaires Math. Sci. Humaines 95 1986 5 18
6. P. Hammer, and A. Kogan Optimal compression of propositional Horn knowledge bases complexity and approximation Artificial Intelligence 64 1 1993 131 145
7. R. Krauße, Kumulierte Klauseln als aussagenlogische Sprachmittel für die Formale Begriffsanalyse, Master Thesis, TU Dresden, 1998.
8. D. Maier The Theory of Relational Data Bases 1983 Computer Science Press Rockville
9. M. Wild Implicational bases for finite closure systems W. Lex Arbeitstagung Begriffsanalyse und Künstliche Intelligenz Informatik-Bericht 89/3 1991 TU Clausthal 147 170
10. M. Wild A theory of finite closure spaces based on implications Adv. Math. 108 1 1994 118 134