Corpus ID: 17641099

# A Deduction Calculus for Cumulated Clauses on FLE Concept Descriptions

@inproceedings{Rudolph2005ADC,
title={A Deduction Calculus for Cumulated Clauses on FLE Concept Descriptions},
author={Sebastian Rudolph},
year={2005}
}
In this paper, we investigate cumulated clauses on a set of attributes consisting of concept descriptions of the description logic FLE . This kind of expression is useful for describing the attribute logic of contexts where the attributes can be seen as FLE concept descriptions. We provide a deduction calculus for this type of expressions and prove its soundness and completeness.
1 Citations
Quo Vadis, CS? - On the (non)-Impact of Conceptual Structures on the Semantic Web
• Computer Science
• ICCS
• 2007
This paper attempts to stimulate the Conceptual Structures community to catch the Semantic Web train by encouraging them to participate in developments on a large scale. Expand

#### References

SHOWING 1-10 OF 19 REFERENCES
Explaining ALC Subsumption
• Computer Science
• Description Logics
• 1999
A solution based on a sequent calculus that is closely related to the tableau implementation, exploiting its optimisations and the resulting proofs are pruned and then presented as simply as possible using templates. Expand
Exploring Relational Structures Via FLE
A method originating from Formal Concept Analysis is proposed which uses empirical data to systematically generate hypothetical axioms about the domain, which are represented to an ontology engineer for decision. Expand
Modal logic
This paper shows how the tree or tableau method provides a simple and easily comprehensible decision procedure for systems such as K, T, S4 and S5 and how the formal techniques of modal logic can be used to analyse several informal problems involving modal concepts, including cases combining modality with quantification. Expand
Conceptual Graphs and Formal Concept Analysis
It is shown how Conceptual Graphs and Formal Concept Analysis may be combined to obtain a formalization of Elementary Logic which is useful for knowledge representation and processing. For this, aExpand
Arbitrary Relations in Formal Concept Analysis and Logical Information Systems
• Computer Science
• ICCS
• 2005
An augmented definition that handles binary relations between objects and a Galois connection is defined on augmented contexts that represents concept inheritance as usual, but also relations between concepts. Expand
Proof Methods for Modal and Intuitionistic Logics
One / Background.- Two / Analytic Modal Tableaus and Consistency Properties.- Three / Logical Consequence, Compactness, Interpolation, and Other Topics.- Four / Axiom Systems and Natural Deduction.-Expand
Formal Concept Analysis Methods for Dynamic Conceptual Graphs
• Computer Science
• ICCS
• 2001
A procedure is demonstrated which interactively asks for the validity of implications and from this information designs a dynamic CG system with the desired properties. Expand
Formal Concept Analysis: Mathematical Foundations
• Computer Science
• 1998
From the Publisher: This is the first textbook on formal concept analysis. It gives a systematic presentation of the mathematical foundations and their relation to applications in computer science,Expand
Applying Formal Concept Analysis to Description Logics
• Mathematics, Computer Science
• ICFCA
• 2004
Methods from formal concept analysis developed for computing concept lattices can be employed for computing subsumption hierarchy of all least common subsumers of subsets of $$\mathcal{C}}$$, and it is shown that these hierarchies can be used to support the bottom-up construction of description logic knowledge bases. Expand
Relational exploration: combining description logics and formal concept analysis for knowledge specification
This work deals with Formal Concept Analysis (FCA) and Description Logic, which have been successfully applied in various areas beyond mathematics and are characteristic for the underlying ways of thinking in two fields of knowledge processing and representation. Expand