References of "Casini, Giovanni 50008649"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailA non-classical logical foundation for naturalised realism
Ruttkamp-Bloem, Emma; Casini, Giovanni UL; Meyer, Thomas

in Arazim, Pavel; Dančák, michal (Eds.) The Logica Yearbook (2015)

Detailed reference viewed: 115 (4 UL)
Full Text
Peer Reviewed
See detailIntroducing Defeasibility into OWL Ontologies
Casini, Giovanni UL; Meyer, Thomas; Moodley, Kody et al

in Arenas, Marcelo; Corcho, Oscar; Simperl, Elena (Eds.) et al 14th International Semantic Web Conference. Bethlehem, PA, USA, October 11–15, 2015 Proceedings, Part II (2015)

In recent years, various approaches have been developed for representing and reasoning with exceptions in OWL. The price one pays for such capabilities, in terms of practical performance, is an important ... [more ▼]

In recent years, various approaches have been developed for representing and reasoning with exceptions in OWL. The price one pays for such capabilities, in terms of practical performance, is an important factor that is yet to be quantified comprehensively. A major barrier is the lack of naturally occurring ontologies with defeasible features - the ideal candidates for evaluation. Such data is unavailable due to absence of tool support for representing defeasible features. In the past, defeasible reasoning implementations have favoured automated generation of defeasible ontologies. While this suffices as a preliminary approach, we posit that a method somewhere in between these two would yield more meaningful results. In this work, we describe a systematic approach to modify real-world OWL ontologies to include defeasible features, and we apply this to the Manchester OWL Repository to generate defeasible ontologies for evaluating our reasoner DIP (Defeasible-Inference Platform). The results of this evaluation are provided together with some insights into where the performance bottle-necks lie for this kind of reasoning. We found that reasoning was feasible on the whole, with surprisingly few bottle-necks in our evaluation. [less ▲]

Detailed reference viewed: 107 (3 UL)
Full Text
See detailProceedings of the 2nd International Workshop on Defeasible and Ampliative Reasoning (DARe-15)
Booth, Richard; Casini, Giovanni UL; Klarman, Szymon et al

Book published by CEUR Workshop Proceedings (2015)

Proceedings of the International Workshop on Defeasible and Ampliative Reasoning (DARe-15), co-located with the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). Buenos Aires ... [more ▼]

Proceedings of the International Workshop on Defeasible and Ampliative Reasoning (DARe-15), co-located with the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). Buenos Aires, Argentina, July 27, 2015. [less ▲]

Detailed reference viewed: 40 (2 UL)
Full Text
Peer Reviewed
See detailOn the Entailment Problem for a Logic of Typicality
Booth, Richard UL; Casini, Giovanni UL; Meyer, Thomas et al

in Yang, Qiang; Wooldridge, Michael (Eds.) Proceedings of the TwentyFourth International Joint Conference on Artificial Intelligence. Buenos Aires, Argentina, 25–31 July 2015 (2015)

Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator. In spite of the non-monotonic features introduced by the ... [more ▼]

Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator. In spite of the non-monotonic features introduced by the semantics adopted for the typicality operator, the obvious Tarskian definition of entailment for PTL remains monotonic and is therefore not appropriate. We investigate different (semantic) versions of entailment for PTL, based on the notion of Rational Closure as defined by Lehmann and Magidor for KLM-style conditionals, and constructed using minimality. Our first important result is an impossibility theorem showing that a set of proposed postulates that at first all seem appropriate for a notion of entailment with regard to typicality cannot be satisfied simultaneously. Closer inspection reveals that this result is best interpreted as an argument for advocating the development of more than one type of PTL entailment. In the spirit of this interpretation, we define two primary forms of entailment for PTL and discuss their advantages and disadvantages. [less ▲]

Detailed reference viewed: 68 (3 UL)