Search dblp for Publications

export results for "Subsumption in w.r.t. Hybrid TBoxes."

 download as .bib file

@inproceedings{DBLP:conf/jelia/Novakovic08,
  author       = {Novak Novakovic},
  editor       = {Steffen H{\"{o}}lldobler and
                  Carsten Lutz and
                  Heinrich Wansing},
  title        = {A Proof-Theoretic Approach to Deciding Subsumption and Computing Least
                  Common Subsumer in w.r.t. Hybrid TBoxes},
  booktitle    = {Logics in Artificial Intelligence, 11th European Conference, {JELIA}
                  2008, Dresden, Germany, September 28 - October 1, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5293},
  pages        = {311--323},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-87803-2\_26},
  doi          = {10.1007/978-3-540-87803-2\_26},
  timestamp    = {Tue, 29 Dec 2020 18:34:12 +0100},
  biburl       = {https://dblp.org/rec/conf/jelia/Novakovic08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ki/BrandtM05,
  author       = {Sebastian Brandt and
                  J{\"{o}}rg Model},
  editor       = {Ulrich Furbach},
  title        = {Subsumption in w.r.t. Hybrid TBoxes},
  booktitle    = {{KI} 2005: Advances in Artificial Intelligence, 28th Annual German
                  Conference on AI, {KI} 2005, Koblenz, Germany, September 11-14, 2005,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3698},
  pages        = {34--48},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11551263\_5},
  doi          = {10.1007/11551263\_5},
  timestamp    = {Tue, 14 May 2019 10:00:49 +0200},
  biburl       = {https://dblp.org/rec/conf/ki/BrandtM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics