A Deduction Calculus for Cumulated Clauses on FLE Concept Descriptions
نویسنده
چکیده
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.
منابع مشابه
Exploring Relational Structures Via FLE
Designing ontologies and specifying axioms of the described domains is an expensive and error-prone task. Thus, we propose a method originating from Formal Concept Analysis which uses empirical data to systematically generate hypothetical axioms about the domain, which are represented to an ontology engineer for decision. In this paper, we focus on axioms that can be expressed as entailment sta...
متن کاملPseudo-models and propositional Horn inference
A well known result is that the inference problem for propositional Horn formulae can be solved in linear time. We show that this remains true even in the presence of arbitrary (static) propositional background knowledge. Our main tool is the notion of a cumulated clause, a slight generalization of the usual clauses in Propositional Logic. We show that each propositional theory has a canonical ...
متن کاملExtending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملMUltlog 1.0: Towards an Expert System for Many-Valued Logics
MUltlog is a system which takes as input the specification of a finitely-valued first-order logic and produces a sequent calculus, a natural deduction system, and a calculus for transforming a many-valued formula to clauses suitable for many-valued resolution. All generated rules are optimized regarding their branching degree. The output is in the form of a scientific paper, written in LTEX.
متن کاملA Programming Tool for Management of a Predicate-Calculus-Oriented Data Base
This paper describes a LISP program, cal led PCDB, for storage and re t r i eva l in a data base of predicate calculus (PC) formulas. The PCDB pacxage uses standardized representations of PC formulas, where ground unit clauses are stored e f f i c i e n t l y , e.g. on the proper tyl is ts of t he i r arguments, and other clauses have other representation. The major part of the PCDB package is ...
متن کامل