Description logics: foundations for class-based knowledge representation

calvanese, 1996, Unrestricted and Finite Model Reasoning in Class-Based Representation Formalisms calvanese, 1995, Structured objects: Modeling and reasoning, LNCS, 1013, 229 buneman, 1997, Semistructured data, Proc of PODS'97, 117, 10.1145/263661.263675 calvanese, 1996, Finite model reasoning in description logics, Proc KR'96, 292 calvanese, 1999, Reasoning in expressive description logics with fixpoints based on automata on infinite trees, Proc IJCAI 99, 8489 10.1145/275487.275504 calvanese, 1998, What can knowledge representation do for semi-structured data?, Proc AAAI 98, 205 calvanese, 2002, 2ATAs make DLs easy, Proc DL 2002, 107 calvanese, 2001, Identification constraints and functional dependencies in description logics, Proc IJCAI 2001, 155 calvanese, 2000, Answering queries using views over description logics knowledge bases, Proc AAAI 2000, 386 10.1093/logcom/9.3.295 10.1007/BF01050635 10.1142/S0218215794000211 10.1109/69.469829 borgida, 1997, Adding uniqueness constraints to description logics (preliminary report), Proc of DOOD'97, 85 brachman, 1984, The tractability of subsumption in frame-based description languages, Proc AAAI-84, 34 10.1016/B978-1-4832-0771-1.50022-9 10.1207/s15516709cog0902_1 bray, 1998, Extensible Markup Language (XML) 1 0 W3C Recommendation baader, 1991, Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles, Proc IJCAI-91 10.1016/B978-1-4832-1452-8.50098-1 10.2307/2695090 buchheit, 1994, Terminological systems revisited: Terminology = schema + views, Proc AAAI 94, 199 10.1145/122296.122298 baader, 1991, A schema for integrating concrete domains into concept languages, Proc IJCAI-91, 452 bull, 1970, An approach to tense logic, Theoria, 12, 171 baader, 2002, The Description Logic Handbook Theory Implementation and Applications buchheit, 1993, Decidable reasoning in terminological knowledge representation systems, J of Artificial Intelligence Research, 1, 109, 10.1613/jair.21 10.1007/978-3-642-76274-1_10 10.1007/3-540-45653-8_15 10.1007/BF00883932 10.1145/132271.132272 10.1109/ICDE.1997.582032 10.1016/S0169-023X(00)00047-1 10.1145/263661.263673 10.1016/0022-0000(82)90018-6 baader, 2000, Tableau algorithms for description logics, LNAI, 1847, 1 bechhofer, 2001, OilEd: A Reason-able ontology editor for the semantic web, LNAI, 2174, 396 baader, 2000, Rewriting concepts using terminologies, Proc of KR'2000, 297 baader, 2000, Fusions of description logics, Proc of DL 2000, 21 10.1305/ndjfl/1093634564 bernholtz, 1994, An automatatheoretic approach to branching-time model checking, LNCS, 818, 142 10.1016/0169-023X(94)90002-7 10.1007/BF00962071 sattler, 2001, The hybrid ?-calculus, Proc IJCAI 2001, 76 rumbaugh, 1998, The Unified Modeling Language Reference Manual 10.1093/acprof:oso/9780198243113.001.0001 10.1016/0022-0000(80)90061-6 10.1145/122296.122314 patel-schneider, 1984, ARGON: Knowledge representation meets information retrieval, Proc IEEE Conf Artificial Intelligence Applications passy, 1985, PDL with data constraints, Information Processing Letters, 20, 35, 10.1016/0020-0190(85)90127-9 patel-schneider, 1984, Small can be beautiful in knowledge representation, Proc Knowledge-Based Syst Workshop 10.1016/0890-5401(91)90026-X 10.1016/B978-1-4832-0771-1.50018-7 10.1016/0004-3702(90)90087-G 10.1016/0004-3702(88)90066-5 10.1016/0304-3975(87)90133-2 10.1007/3-540-45744-5_5 lutz, 1999, Reasoning with concrete domains, Proc IJCAI 99, 90 10.1016/S0004-3702(98)00048-4 levy, 1996, Query answering algorithms for information agents, Proc AAAI 96, 4047 10.1111/j.1467-8640.1987.tb00176.x baader, 1999, Computing least common subsumers in description logics with existential restrictions, Proc IJCAI 99, 96 10.1016/S0004-3702(98)00109-X lenzerini, 1991, Concept languages as query languages, Proc AAAI 91, 471 tobies, 2000, The complexity of reasoning with cardinality restrictions and nominals in expressive description logics, J of Artificial Intelligence Research, 12, 199, 10.1613/jair.705 tobies, 2001, Complexity Results and Practical Algorithms for Logics in Knowledge Representation hollunder, 1991, Qualifying Number Restrictions in Concept Languages 10.1016/B978-0-444-88074-1.50009-3 haarslev, 2001, RACER system description, LNAI, 2083, 701 10.1007/978-3-642-59126-6_7 haarslev, 2001, High performance reasoning with very large knowledge bases: A practical case study, Proc IJCAI 2001, 161 10.1016/0004-3702(91)90078-X 10.1142/S0218215793000034 schild, 1991, A correspondence theory for terminological logics: Preliminary report, Proc IJCAI-91, 466 schild, 1994, Terminological cycles and the propositional ?-calculus, Proc of KR'94, 509 ullman, 1997, Information integration using logical views, LNCS, 1186, 19 van der hoek, 1992, On the semantics of graded modalities, Journal of Applied Non-Classical Logics, 2, 81 horrocks, 2002, Daml+oil: A description logic for the semantic web, Data Engineering Bulletin, 25, 4 10.1093/logcom/9.3.267 hollunder, 1991, Qualifying number restrictions in concept languages, Proc of KR'91, 335 horrocks, 1998, Using an expressive description logic: FaCT or fiction?, Proc KR'98, 636 10.1007/BFb0025769 kupferman, 2002, The complexity of the graded mu-calculus, Proc of CADUI'2002 10.1093/logcom/9.3.385 khizder, 2001, On decidability and complexity of description logics with uniqueness constraints, Proc of ICDT 2001 10.1109/SFCS.1991.185392 10.1016/S0004-3702(00)00070-9 10.1109/5254.920598 10.1007/BF00379767 vardi, 1998, Reasoning about the past with two-way automata, LNCS, 1443, 628 10.1016/0022-0000(86)90026-7 weida, 1992, Terminological reasoning with constraint networks and an application to plan recognition, Proc KR 92, 282 10.1016/0898-1221(92)90139-9 10.1305/ndjfl/1093890715 10.1093/logcom/5.3.325 10.1016/0022-0000(79)90046-1 franconi, 2000, The i.com tool for intelligent conceptual modeling, Proc of KR'2000, 45 10.1007/BF01054038 10.1016/0304-3975(88)90126-0 10.1142/S0218843000000181 gonc?alve?s, 2000, Decidability issues for action guarded logics, Proc of DL 2000, 123 10.1016/0004-3702(92)90076-A 10.1145/248233.248253 10.1006/inco.1999.2852 de giacomo, 1997, A uniform framework for concept definitions in description logics, J of Artificial Intelligence Research, 6, 87, 10.1613/jair.334 de giacomo, 1996, TBox and ABox reasoning in expressive description logics, Proc KR'96, 316 donini, 1996, Reasoning in description logics, Principles of Knowledge Representation, 193 10.1023/A:1008687430626 10.1016/S0004-3702(98)00009-5 10.1093/logcom/4.4.423 donini, 1991, Tractable concept languages, Proc IJCAI-91, 458 10.1006/inco.1997.2625 10.1142/S0218215793000174 calvanese, 1999, Unifying classbased representation formalisms, J of Artificial Intelligence Research, 11, 199, 10.1613/jair.548 calvanese, 1998, Description logic framework for information integration, Proc KR'98, 2 10.1016/B978-044450813-3/50025-4 10.1016/B978-1-4832-1452-8.50107-X 10.1145/182591.182620 de giacomo, 1994, Boosting the correspondence between description logics and propositional dynamic logics, Proc AAAI 94, 205 de giacomo, 1994, Concept language with number restrictions and fixpoints, and its relationship with ?-calculus, Proc EEC 94, 411 de giacomo, 1994, Description logics with inverse roles, functional restrictions, and n-ary relations, LNAI, 838, 332 de giacomo, 1995, What's in an aggregate: Foundations for description logics with tuples and sets, Proc of IJCAI'95, 801 de giacomo, 1995, Decidability of Class-Based Knowledge Representation Formalisms