32
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      The Incredible ELK : From Polynomial Procedures to Efficient Reasoning with ℰ ℒ $\mathcal {E} \mathcal {L}$ Ontologies

      , ,
      Journal of Automated Reasoning
      Springer Nature

      Read this article at

      ScienceOpenPublisher
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references24

          • Record: found
          • Abstract: not found
          • Article: not found

          Rete: A fast algorithm for the many pattern/many object pattern match problem

            • Record: found
            • Abstract: not found
            • Article: not found

            Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

              • Record: found
              • Abstract: not found
              • Article: not found

              Linear-time algorithms for testing the satisfiability of propositional horn formulae

                Author and article information

                Journal
                Journal of Automated Reasoning
                J Autom Reasoning
                Springer Nature
                0168-7433
                1573-0670
                June 2014
                November 17 2013
                : 53
                : 1
                : 1-61
                Article
                10.1007/s10817-013-9296-3
                a0c21b34-a35b-4b35-b65d-265e7e57a0dc
                © 2013
                History

                Comments

                Comment on this article

                Related Documents Log