Filters








6 Hits in 6.7 sec

Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report) [article]

Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann, Alisa Kovtunova
2020 arXiv   pre-print
We have evaluated this approach on a set of realistic ontologies and compared the obtained proofs with proofs generated by the DL reasoner ELK, finding that forgetting-based proofs are often better w.r.t  ...  is polynomial or exponential; (ii) proofs may or may not reuse already derived consequences; and (iii) the number n is represented in unary or binary.  ...  Acknowledgements This work was partially supported by DFG grant 389792660 as part of TRR 248 (https://perspicuous-computing.science), and the DFG Research Training Group QuantLA, GRK 1763 (https://lat.inf.tu-dresden.de  ... 
arXiv:2004.08311v2 fatcat:rz4frvtnrndj7ik36ouq4w47ku

Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report) [article]

Christian Alrabbaa and Franz Baader and Stefan Borgwardt and Patrick Koopmann and Alisa Kovtunova
2022 arXiv   pre-print
How comprehensible such a proof is depends not only on the employed calculus, but also on the properties of the particular proof, such as its overall size, its depth, the complexity of the employed sentences  ...  If, for instance, a Description Logic reasoner derives a consequence that triggers some action of the overall system, then one can explain such an entailment by presenting a proof of the consequence in  ...  Acknowledgements This work was supported by the DFG in grant 389792660 as part of TRR 248 (https://perspicuous-computing.science), and QuantLA, GRK 1763 (https://lat.inf.tu-dresden.de/quantla).  ... 
arXiv:2104.13138v2 fatcat:4uhvrca75jfjnkpxwwlmmwqohe

Report from Dagstuhl Seminar 13252 Interoperation in Complex Information Ecosystems

Andreas Harth, Craig Knoblock, Kai-Uwe Sattler, Rudi Studer, Andreas Harth, Craig Knoblock, Kai-Uwe Sattler, Rudi Studer, Andreas Harth, Craig Knoblock, Kai-Uwe Sattler, Rudi Studer (+1 others)
unpublished
of architectures and methods, to develop a research agenda and road-map towards a vision of web-scale integration and interoperation.  ...  Such an ad-hoc model is in contrast to previous integration models which required the construction of a mediated schema and the integration of schema and data before any queries-even simple ones-could  ...  Acknowledgments This paper presents results of joint efforts of a group of colleagues including Sudhir Agarwal (Stanford University), Charles J. Petrie (Stanford University), and the author.  ... 
fatcat:pvkkluf6h5f7jho5hwwxwx6a6y

Finding Small Proofs for Description Logic Entailments: Theory and Practice

Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann, Alisa Kovtunova
unpublished
We have evaluated this approach on a set of realistic ontologies and compared the obtained proofs with proofs generated by the DL reasoner ELK, finding that forgetting-based proofs are often better w.r.t  ...  is polynomial or exponential; (ii) proofs may or may not reuse already derived consequences; and (iii) the number n is represented in unary or binary.  ...  Acknowledgements This work was partially supported by DFG grant 389792660 as part of TRR 248 (https://perspicuous-computing.science), and the DFG Research Training Group QuantLA, GRK 1763 (https://lat.inf.tu-dresden.de  ... 
doi:10.29007/nhpp fatcat:pa6ao2xhrvewvenwxo5t4tccmy

Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142)

Bernadette Charron-Bost, Stepahn Merz, Andrey Rybalchenko, Josef Widder, Albert Cohen, Alastair Donaldson, Marieke Huisman, Joost-Pieter Katoen, Stephen Kobourov, Martin Nöllenburg, Monique, Sergiu Hart (+2 others)
2013 unpublished
I discuss the problem definition, the variations and different objectives, and the pitfalls. I also survey the classical algorithms of Douglas and Peucker; Imai and Iri; and of Chan and Chin.  ...  We implemented our parallel algorithms on top of the probabilistic model checker PRISM.  ...  Pautasso, Live Mashup Tools: Challenges and Opportunities, accepted at the First ICSE International Workshop on Live Programming (LIVE 2013), San Francisco, USA, May 2013. S. Aghaee, C.  ... 
fatcat:m7452gw4cvecbd2vi6w3uha5ai

Dagstuhl Reports, Volume 7, Issue 2, February 2017, Complete Issue [article]

2017
We compare this to a recent characterization of the notion of 1-randomness, also in terms of differentiability.  ...  We present a theorem characterizing the notion of 1-genericity in terms of differentiable functions.  ...  of Nantes in France.  ... 
doi:10.4230/dagrep.7.2 fatcat:ydwbggkkxjfahomhv75rjaguiy