Modal logics, description logics and arithmetic reasoning

Artificial Intelligence

Volumn 109, Issue 1, 1999, Pages 1-31

  Ohlbach, Hans Jürgen ^a   Koehler, Jana ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; FORMAL LOGIC; MATHEMATICAL PROGRAMMING;

DESCRIPTION LOGIC; INFERENCE SYSTEMS; MODAL LOGIC; PROPOSITIONAL LOGIC;

ARTIFICIAL INTELLIGENCE;

EID: 0033522692     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00011-9     Document Type: Article

References (26)

1. W. Ackermann, Untersuchung über das eliminationsproblem der mathematischen logik, Mathematische Annalen 110 (1935) 390-413.
2. F. Baader, B. Hollunder, KRIS: Knowledge representation and inference system, SIGART Bull. 2 (2) (1991) 8-15.
3. F. Baader, P. Hanschke, A scheme for integrating concrete domains into concept languages, in: J. Mylopolous, R. Reiter (Eds.), Proc. IJCAI-91, Sydney, Australia, 1991, Morgan Kaufmann, San Mateo, CA, 1991, pp. 452-457
4. F. Baader, U. Sattler, Description logics with symbolic number restrictions, in: W. Wahlster (Ed.), Proc. ECAI-96, Wiley, New York, 1996, pp. 283-287; an extended version has appeared as Technical Report LTCS-96-03.
5. F. Baader, U. Sattler, Description logics with concrete domains and aggregation, in: H. Prade (Ed.), Proc. ECAI-98, Wiley, New York, 1998, pp. 336-340.
6. A. Borgida, P. Patel-Schneider, A semantics and complete algorithm for subsumption in the classic description logic, J. Artificial Intelligence Research 1 (1994) 277-308.
7. R.J. Brachman, J. Schmolze, An overview of the KL-ONE knowledge representation system, Cognitive Sci. 9 (2) (1985) 171-216.
8. R.J. Brachman, D.L. McGuinness, P.F. Patel-Schneider, L.A. Resnick, A Borgida, Living with classic: When and how to use a KL-ONE-like language, in: J. Sowa (Ed.), Principles of Semantic Networks, Morgan Kaufmann, San Mateo, CA, 1991, pp. 401-456.
9. D. Calvanese, Finite model reasoning in description logics, in: Proc. Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-96), Morgan Kaufmann, San Mateo, CA, 1996, pp. 292-303.
10. D. Calvanese, M. Lenzerini, Making object-oriented schemas more expressive, in: Proc. PODC-94, ACM Press/Addison-Wesley, Reading, MA, 1994, pp. 243-254.
11. D. Calvanese, M. Lenzerini, D. Nardi, A unified framework for class based representation formalisms, in: J. Doyle, E. Sandewall, P. Torasso (Eds.), Proc. Fourth Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany, Morgan Kaufmann, San Mateo, CA, 1994, pp. 109-120.
12. B.F. Chellas, Modal Logic: An Introduction, Cambridge Univ. Press, Cambridge, 1980.
13. A. Chargov, M. Zakharayaschev, Modal Logic, Oxford Logic Guides, Vol. 35, Oxford Univ. Press, Oxford, 1997.
14. M. Davis, Hilbert's tenth problem is undecidable, Amer. Math. Monthly 80 (1973) 233-269.
15. F. Donini, M. Lenzerini, D. Nardi, W. Nutt, The complexity of concept languages, Research Report DFKI-RR-95-07, DFKI, 1995.
16. D.M. Gabbay, H.J. Ohlbach, Quantifier elimination in second-order predicate logic, in: B. Nebel, C. Rich, W. Swartout (Eds.), Proc. Third Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA, Morgan Kaufmann, San Mateo, CA, 1992, pp. 425-435.
17. I. Horrocks, U. Sattler, A description logic with transitive and converse roles and role hierarchies, in: Proc. International Workshop on Description Logics, IRST, Povo-Trento, Italy, 1998.
18. R. MacGregor, A description classifier for the predicate calculus, in: Proc. AAAI-94, Seattle, WA, 1994, Morgan Kaufmann, San Francisco, CA, 1994, pp. 213-220.
19. M. Minsky, A framework for representing knowledge, reprinted in: R.J. Brachman, H.J. Levesque (Eds.), Readings in Knowledge Representation, Morgan Kaufmann, San Francisco, CA, 1990, pp. 245-262.
20. B. Nebel, Reasoning and Revision in Hybrid Representation Systems, Lecture Notes in Artificial Intelligence, Vol. 422, Springer, Berlin, 1990.
21. B. Nebel, Terminological cycles: Semantics and computational properties, in: J.F. Sowa (Ed.), Principles of Semantic Networks, Morgan Kaufmann, San Mateo, CA, 1991, pp. 331-361.
22. H.J. Ohlbach, J. Koehler, How to extend a formal system with a boolean algebra component, in: P.H. Schmidt, W. Bibel (Eds.), Automated Deduction. A Basis for Applications, Vol. III, Kluwer Academic, Dordrecht, 1998, pp. 57-75.
23. K. Schild, A correspondence theory for terminological logics: Preliminary report, in: Proc. IJCAI-91, Sydney, Australia, 1991, Morgan Kaufmann, San Mateo, CA, 1991, pp. 466-471.
24. K. Schild, Terminological cycles and the propositional μ-calculus, in: Proc. Fourth Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany, Morgan Kaufmann, San Mateo, CA, 1994, pp. 509-520.
25. M. Schmidt-Schauß, G. Smolka, Attributive concept descriptions with complements, Artificial Intelligence 48 (1991) 1-26.
26. M.H. Stone, The theory of representations for Boolean algebras, Trans. Amer. Math. Soc. 40 (1936) 37-111.