Subsumption and Count as Relation in Arguments Ontologies

Reference : Subsumption and Count as Relation in Arguments Ontologies


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a journal
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/15941

Title :	Subsumption and Count as Relation in Arguments Ontologies
Language :	English
Author, co-author :	Boella, Guido [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Gabbay, Dov M. [King’s College London, Department of Computer Science, London, UK]
	Villata, Serena [> >]
Publication date :	2010
Journal title :	Procs. of the 13th International Workshop on Non-Monotonic Reasoning (NMR'10)
Peer reviewed :	Yes
Event name :	Procs. of the 13th International Workshop on Non-Monotonic Reasoning (NMR'10)
Event date :	2010
Abstract :	[en] The paper proposes a representation of the subsumption re- lation and of count as conditional in the context of argument ontologies. Starting from the weaker notion of classification represented by the subsumption relation towards the stronger notion of count as, we show how to reason whether an argu- ment is accepted in ontologies involving these two notions. We adopt the methodology of meta-argumentation in order to model the design decisions. Argumentation, being able to handle contradictory information, is proposed as technique to reason about count as for ontology interoperability.
Permalink :	http://hdl.handle.net/10993/15941

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	nmr10.pdf		Publisher postprint	726.92 kB	View/Open

All documents in ORBi^lu are protected by a user license.