Deciding expressive description logics in the framework of resolution

Information and Computation

Volumn 206, Issue 5, 2008, Pages 579-601

  Hustadt, Ullrich ^a   Motik, Boris ^b   Sattler, Ulrike ^c  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Basic superposition; Description logics; Resolution decision procedure

Indexed keywords

ALGORITHMS; DECISION MAKING; THEOREM PROVING;

BASIC SUPERPOSITION; DESCRIPTION LOGICS; RESOLUTION DECISION PROCEDURE;

LOGIC PROGRAMMING;

EID: 41349083943     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.11.006     Document Type: Article

References (49)

1. In: Baader F., Calvanese D., McGuinness D., Nardi D., and Patel-Schneider P.F. (Eds). The Description Logic Handbook: Theory, Implementation and Applications (2003), Cambridge University Press, Cambridge
2. P.F. Patel-Schneider, P. Hayes, I. Horrocks, OWL Web Ontology Language: Semantics and Abstract Syntax, W3C Recommendation, (accessed February 10 2004).
3. Horrocks I., Sattler U., and Tobies S. Practical reasoning for very expressive description logics. Logic Journal of the IGPL 8 3 (2000) 239-263
4. I. Horrocks, Optimising Tableaux Decision Procedures for Description Logics, Ph.D. Thesis, University of Manchester, UK, 1997.
5. V. Haarslev, R. Möller, RACER system description, in: R. Goré, A. Leitsch, T. Nipkow (Eds.), Proc. of the First Int. Joint Conf. on Automated Reasoning (IJCAR 2001), vol. 2083, LNAI, Springer, Siena, Italy, 2001, pp. 701-706.
6. S. Tobies, Complexity Results and Practical Algorithms for Logics in Knowledge Representation, Ph.D. Thesis, RWTH Aachen, Germany, 2001.
7. Donini F.M., and Massacci F. ExpTime tableaux for ALC. Artificial Intelligence 124 1 (2000) 87-138
8. Weidenbach C. Combining superposition, sorts and splitting. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. II (2001), Elsevier Science 1965-2013 (Chapter 27)
9. R.A. Schmidt, U. Hustadt, A resolution decision procedure for fluted logic, in: D. McAllester (Ed.), Proc. of the 17th Int. Conf. on Automated Deduction (CADE-17), vol. 1831 of LNAI, Springer, Pittsburgh, PA, USA, 2000, pp. 433-448.
10. Bachmair L., and Ganzinger H. Resolution theorem proving. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. I (2001), Elsevier Science 19-99 (Chapter 2)
11. - description logic to disjunctive datalog programs. In: Dubois D., Welty C.A., and Williams M.-A. (Eds). Proc. of the 9th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2004) (2004), AAAI Press, Whistler, Canada 152-162
12. B. Motik, U. Sattler, A comparison of reasoning techniques for querying large description logic ABoxes, in: M. Hermann, A. Voronkov (Eds.), Proc. of the 13th Int. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2006), vol. 4246, LNCS, Springer, Phnom Penh, Cambodia, 2006, pp. 227-241.
13. U. Hustadt, B. Motik, U. Sattler, A decomposition rule for decision procedures by resolution-based calculi, in: F. Baader, A. Voronkov (Eds.), Proc. of the 11th Int. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2004), vol. 3452, LNAI, Springer, Montevideo, Uruguay, 2005, pp. 21-35.
14. Calvanese D., Lenzerini M., and Nardi D. Unifying class-based representation formalisms. Journal of Artificial Intelligence Research (JAIR) 11 (1999) 199-240
15. Chen P.P. The entity-relationship model-toward a unified view of data. ACM Transaction on Database Systems 1 1 (1976) 9-36
16. Bachmair L., Ganzinger H., Lynch C., and Snyder W. Basic paramodulation. Information and Computation 121 2 (1995) 172-192
17. Nieuwenhuis R., and Rubio A. Theorem proving with ordering and equality constrained clauses. Journal of Symbolic Computation 19 4 (1995) 312-351
18. Dershowitz N., and Plaisted D.A. Rewriting. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. I (2001), Elsevier Science 535-610 (Chapter 9)
19. Baader F., and Nipkow T. Term Rewriting and All That (1998), Cambridge University Press, Cambridge
20. Joyner Jr. W.H. Resolution strategies as decision procedures. Journal of the ACM 23 3 (1976) 398-417
21. U. Hustadt, Resolution-based decision procedures for subclasses of first-order logic, Ph.D. Thesis, Universität des Saarlandes, Germany, 1999.
22. Y. Kazakov, H. de Nivelle, A resolution decision procedure for the guarded fragment with transitive guards, in: D. Basin, M. Rusinowitch (Eds.), Proc. of 2nd Int. Joint Conf. on Automated Reasoning (IJCAR 2004), vol. 3097, LNAI, Springer, Cork, Ireland, 2004, pp. 122-136.
23. R.A. Schmidt, U. Hustadt, A principle for incorporating axioms into the first-order translation of modal formulae, in: F. Baader (Ed.), Proc. of the 19th Int. Conf. on Automated Deduction (CADE-19), vol. 2741, LNAI, Springer, Miami Beach, FL, USA, 2003, pp. 412-426.
24. Fisher N.J., and Ladner R.E. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18 (1979) 194-211
25. B. Motik, Reasoning in Description Logics using Resolution and Deductive Databases, Ph.D. Thesis, Univesität Karlsruhe, Germany, 2006.
26. Plaisted D.A., and Greenbaum S. A structure-preserving clause form translation. Journal of Symbolic Logic and Computation 2 3 (1986) 293-304
27. Nonnengart A., and Weidenbach C. Computing small clause normal forms. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. I (2001), Elsevier Science 335-367 (Chapter 6)
28. Baaz M., Egly U., and Leitsch A. Normal form transformations. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. I (2001), Elsevier Science 273-333 (Chapter 5)
29. Nivelle H.D., Schmidt R.A., and Hustadt U. Resolution-based methods for modal logics. Logic Journal of the IGPL 8 3 (2000) 265-292
30. Gottlob G., and Leitsch A. On the efficiency of subsumption algorithms. Journal of the ACM 32 2 (1985) 280-295
31. V. Haarslev, R. Möller, Optimization strategies for instance retrieval, in: I. Horrocks, S. Tessaris, J.Z. Pan (Eds.), Proc. of the 2002 Int. Workshop on Description Logics (DL 2002), vol. 53 of CEUR Workshop Proceedings, Toulouse, France, 2002.
32. T. Tammet, Resolution Methods for Decision Problems and Finite-Model Building, Ph.D. Thesis, Göteborg University, Sweden, 1992.
33. Leitsch A. Deciding clause classes by semantic clash resolution. Fundamenta Informaticae 18 (1993) 163-182
34. Peltier N. On the decidability of the PVD class with equality. Logic Journal of the IGPL 9 4 (2001) 601-624
35. C. Fermüller, T. Tammet, N. Zamov, A. Leitsch, Resolution Methods for the Decision Problem, vol. 679, LNAI, Springer, 1993.
36. U. Hustadt, R.A. Schmidt, Issues of decidability for description logics in the framework of resolution, in: R. Caferra, G. Salzer (Eds.), Selected Papers from Automated Deduction in Classical and Non-Classical Logics, vol. 1761, LNAI, Springer, 1999, pp. 191-205.
37. Ganzinger H., Hustadt U., Meyer C., and Schmidt R.A. A resolution-based decision procedure for extensions of K4. In: Zakharyaschev M., Segerberg K., de Rijke M., and Wansing H. (Eds). Proc. of the Second Intl. Workshop on Advances in Modal Logic (AiML '98) (2000), CSLI Publications, Uppsala, Sweden 243-263
38. Bachmair L., and Ganzinger H. Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM 45 6 (1998) 1007-1049
39. Andréka H., van Benthem J., and Németi I. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27 3 (1998) 217-274
40. H. de Nivelle, A Resolution Decision Procedure for the Guarded Fragment, in: C. Kirchner, H. Kirchner (Eds.), Proc. of the 15th Int. Conf. on Automated Deduction (CADE-15), vol. 1421, LNAI, Springer, Lindau, Germany, 1998, pp. 191-204.
41. Ganzinger H., and de Nivelle H. A superposition decision procedure for the guarded fragment with equality. Proc. of the 14th IEEE Symposium on Logic in Computer Science (LICS '99) (1999), IEEE Computer Society, Trento, Italy 295-305
42. Bachmair L., and Ganzinger H. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 4 3 (1994) 217-247
43. Schild K. A correspondence theory for terminological logics: preliminary report. In: Mylopoulos J., and Reiter R. (Eds). Proc. of 12th Int. Joint Conf. on Artificial Intelligence (IJCAI '91) (1991), Morgan Kaufmann Publishers, Sydney, Australia 466-471
44. Hodkinson I. Loosely guarded fragment of first-order logic has the finite model property. Studia Logica 70 2 (2002) 205-240
45. Grädel E., Otto M., and Rosen E. Two-variable logic with counting is decidable. Proc. of the 12th IEEE Symposium on Logic in Computer Science (LICS '97) (1997), IEEE Computer Society, Warsaw, Poland 306-317
46. Pacholski L., Szwast W., and Tendera L. Complexity results for first-order two-variable logic with counting. SIAM Journal on Computing 29 4 (2000) 1083-1117
47. I. Pratt-Hartmann, Counting Quantifiers and the Stellar Fragment, Tech. Report., University of Manchester, UK, submitted for publication.
48. H. de Nivelle, Splitting through new proposition symbols, in: R. Nieuwenhuis, A. Voronkov (Eds.), Proc. of the 8th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2001), vol. 2250, LNAI, Springer, Havana, Cuba, 2001, pp. 172-185.
49. Riazanov A., and Voronkov A. Splitting without backtracking. In: Nebel B. (Ed). Proc. of the 7th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001) (2001), Morgan Kaufmann Publishers, Seattle, WA, USA 611-617