@inproceedings{ OhlbachSchmidtHustadt95,
  author = {Ohlbach, Hans Jürgen and Schmidt, Renate A. and 
              Hustadt, Ullrich},
  title = {Symbolic Arithmetical Reasoning with Qualified Number 
              Restrictions},
  booktitle = {International Workshop on Description Logics},
  pmonth = {May},
  pyear = {1995},
  editor = {Borgida, A. and Lenzerini, M. and Nardi, D. and Nebel, B.},
  pages = {89--95},
  caddress = {Rome, Italy},
  cmonth = {June~2--3},
  cyear = {1995},
  note = {Appeared as Technical Report RAP.07.95, Dipartimento di 
              Informatica e Sistemistica, Univ. degli studia di Roma, 
              1995},
  abstract = {Many inference systems used for concept description logics 
     are constraint systems that employ tableaux methods. These have the 
     disadvantage that for reasoning with qualified number 
     restrictions n new constant symbols are generated for each concept 
     of the form (atleast n R C). In this paper we present an alternative
     method that avoids the generation of constants and uses a restricted
     form of symbolic arithmetic considerably different from the tableaux
     method. The method we use is introduced in Ohlbach, Schmidt and 
     Hustadt (May 1995) for reasoning with graded modalities. We exploit 
     the exact correspondence between the concept description language 
     ALCN and the multi-modal version of the graded modal logic K and 
     show how the method can be applied to ALCN as well. 
     This paper is a condensed version of Ohlbach et al. (May 1995). We 
     omit proofs and much of the technical details, but we include some 
     examples.}
}

{"_id":{"_str":"52015028d40bcbb0410008bc"},"__v":0,"authorIDs":[],"author_short":["Ohlbach","Jürgen, H.","Schmidt, R.<nbsp>A.","Hustadt, U."],"bibbaseid":"-jrgen-schmidt-hustadt-symbolicarithmeticalreasoningwithqualifiednumberrestrictions","bibdata":{"html":"<div class=\"bibbase_paper\">\n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"OhlbachSchmidtHustadt95\"> </a>Symbolic Arithmetical Reasoning with Qualified Number Restrictions.</span>\n\t<span class=\"bibbase_paper_author\">\nOhlbach; Jürgen, H.; Schmidt, R.&nbsp;A.; and Hustadt, U.</span>\n\t<!-- <span class=\"bibbase_paper_year\">undefined</span>. -->\n</span>\n\n\n\nIn\nBorgida, A.; Lenzerini, M.; Nardi, D.; and Nebel, B., editor, <i>International Workshop on Description Logics</i>, page 89--95, .\n\n\n\nAppeared as Technical Report RAP.07.95, Dipartimento di Informatica e Sistemistica, Univ. degli studia di Roma, 1995.\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n \n <a href=\"javascript:showBib('OhlbachSchmidtHustadt95')\">\n <img src=\"http://www.bibbase.org/img/filetypes/bib.png\" \n\t alt=\"Symbolic Arithmetical Reasoning with Qualified Number Restrictions [bib]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span></a>\n \n &nbsp; \n\n \n \n &nbsp;\n \n \n\n \n <a class=\"bibbase_abstract_link\" href=\"javascript:showAbstract('OhlbachSchmidtHustadt95')\">Abstract</a>\n \n \n</span>\n\n<!-- -->\n<!-- <div id=\"abstract_OhlbachSchmidtHustadt95\"> -->\n<!-- Many inference systems used for concept description logics are constraint systems that employ tableaux methods. These have the disadvantage that for reasoning with qualified number restrictions n new constant symbols are generated for each concept of the form (atleast n R C). In this paper we present an alternative method that avoids the generation of constants and uses a restricted form of symbolic arithmetic considerably different from the tableaux method. The method we use is introduced in Ohlbach, Schmidt and Hustadt (May 1995) for reasoning with graded modalities. We exploit the exact correspondence between the concept description language ALCN and the multi-modal version of the graded modal logic K and show how the method can be applied to ALCN as well. This paper is a condensed version of Ohlbach et al. (May 1995). We omit proofs and much of the technical details, but we include some examples. -->\n<!-- </div> -->\n<!-- -->\n\n</div>\n","downloads":0,"bibbaseid":"-jrgen-schmidt-hustadt-symbolicarithmeticalreasoningwithqualifiednumberrestrictions","role":"author","type":"inproceedings","title":"Symbolic Arithmetical Reasoning with Qualified Number Restrictions","pyear":"1995","pmonth":"May","pages":"89--95","note":"Appeared as Technical Report RAP.07.95, Dipartimento di Informatica e Sistemistica, Univ. degli studia di Roma, 1995","key":"OhlbachSchmidtHustadt95","id":"OhlbachSchmidtHustadt95","editor_short":["Borgida, A.","Lenzerini, M.","Nardi, D.","Nebel, B."],"editor":["Borgida, A.","Lenzerini, M.","Nardi, D.","Nebel, B."],"cyear":"1995","cmonth":"June~2--3","caddress":"Rome, Italy","booktitle":"International Workshop on Description Logics","bibtype":"inproceedings","bibtex":"@inproceedings{ OhlbachSchmidtHustadt95,\n author = {Ohlbach, Hans Jürgen and Schmidt, Renate A. and \n Hustadt, Ullrich},\n title = {Symbolic Arithmetical Reasoning with Qualified Number \n Restrictions},\n booktitle = {International Workshop on Description Logics},\n pmonth = {May},\n pyear = {1995},\n editor = {Borgida, A. and Lenzerini, M. and Nardi, D. and Nebel, B.},\n pages = {89--95},\n caddress = {Rome, Italy},\n cmonth = {June~2--3},\n cyear = {1995},\n note = {Appeared as Technical Report RAP.07.95, Dipartimento di \n Informatica e Sistemistica, Univ. degli studia di Roma, \n 1995},\n abstract = {Many inference systems used for concept description logics \n are constraint systems that employ tableaux methods. These have the \n disadvantage that for reasoning with qualified number \n restrictions n new constant symbols are generated for each concept \n of the form (atleast n R C). In this paper we present an alternative\n method that avoids the generation of constants and uses a restricted\n form of symbolic arithmetic considerably different from the tableaux\n method. The method we use is introduced in Ohlbach, Schmidt and \n Hustadt (May 1995) for reasoning with graded modalities. We exploit \n the exact correspondence between the concept description language \n ALCN and the multi-modal version of the graded modal logic K and \n show how the method can be applied to ALCN as well. \n This paper is a condensed version of Ohlbach et al. (May 1995). We \n omit proofs and much of the technical details, but we include some \n examples.}\n}","author_short":["Ohlbach","Jürgen, H.","Schmidt, R.<nbsp>A.","Hustadt, U."],"author":["Ohlbach","Jürgen, Hans","Schmidt, Renate A.","Hustadt, Ullrich"],"abstract":"Many inference systems used for concept description logics are constraint systems that employ tableaux methods. These have the disadvantage that for reasoning with qualified number restrictions n new constant symbols are generated for each concept of the form (atleast n R C). In this paper we present an alternative method that avoids the generation of constants and uses a restricted form of symbolic arithmetic considerably different from the tableaux method. The method we use is introduced in Ohlbach, Schmidt and Hustadt (May 1995) for reasoning with graded modalities. We exploit the exact correspondence between the concept description language ALCN and the multi-modal version of the graded modal logic K and show how the method can be applied to ALCN as well. This paper is a condensed version of Ohlbach et al. (May 1995). We omit proofs and much of the technical details, but we include some examples."},"bibtype":"inproceedings","biburl":"http://www.csc.liv.ac.uk/~ullrich/publications/uh-2013-08-06.bib","downloads":0,"title":"Symbolic Arithmetical Reasoning with Qualified Number Restrictions","year":null,"dataSources":["p6py5bqMdg7vzjQS3"]}