Reasoning and revision in hybrid representation systems
Reasoning and revision in hybrid representation systems
Automata, Languages, and Machines
Automata, Languages, and Machines
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An algorithm for functional uncertainty
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Partonomic reasoning as taxonomic reasoning in medicine
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Practical Reasoning for Expressive Description Logics
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Unification in a Description Logic with Transitive Closure of Roles
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A NExpTime-Complete Description Logic Strictly Contained in C2
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Dynamics of Approximate Information Fusion
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Automata-Based Axiom Pinpointing
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
Computational Logic in Multi-Agent Systems
Decidability of $\mathcal{SHI}$ with Transitive Closure of Roles
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Reasoning within expressive fuzzy rough description logics
Fuzzy Sets and Systems
Decidability of SHIQ with complex role inclusion axioms
Artificial Intelligence
Non-standard inferences in description logics
Non-standard inferences in description logics
Logic-based knowledge representation
Artificial intelligence today
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
PDL with intersection and converse is decidable
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Hi-index | 0.00 |
In Baader (1990,1990a), we have considered different types of semantics for terminologicial cycles in the concept language TLQ which allows only conjunction of concepts and value-restrictions. It turned out that greatest fixed-point semantics (gfp-semantics) seems to be most appropriate for cycles in this language. In the present paper we shall show that the concept defining facilities of FLO with cyclic definitions and gfp-semantics can also be obtained in a different way. One may replace cycles by role definitions involving union, composition, and transitive closure of roles. This proposes a way of retaining, in an extended language, the pleasant features of gfp-semantics for FLQ with cyclic definitions without running into the troubles caused by cycles in larger languages. Starting with the language ALC of Schmidt-Schauß&Smolka (1988)--which allows negation, conjunction and disjunction of concepts as well as value-restrictions and exists-in-restrictions--we shall disallow cyclic concept definitions, but instead shall add the possibility of role definitions involving union, composition, and transitive closure of roles. In contrast to other terminological KR-systems which incorporate the transitive closure operator for roles, we shall be able to give a sound and complete algorithm for concept subsumption.