Sciweavers

409 search results - page 9 / 82
» Semantics for a theory of defeasible reasoning
Sort
View
DEXAW
2002
IEEE
99views Database» more  DEXAW 2002»
14 years 13 days ago
Using Preference Order in Ontologies
The latest ontology languages can be translated into a description logic (DL), thus providing them with a formal semantics and associated reasoning procedures. We introduce the or...
Stijn Heymans, Dirk Vermeir
COMMA
2008
13 years 9 months ago
Semantics for Evidence-Based Argumentation
Abstract. The identification of consistent sets of arguments is one of the most important concerns in the development of computational models of argument. Such extensions drive the...
Nir Oren, Timothy J. Norman
ECSQARU
2005
Springer
14 years 1 months ago
Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Carlos Iván Chesñevar, Guillermo Ric...
RR
2007
Springer
14 years 1 months ago
Proof Explanation in the DR-DEVICE System
Trust is a vital feature for the Semantic Web: If users (humans and agents) are to use and integrate system answers, they must trust them. Thus, systems should be able to explain t...
Nick Bassiliades, Grigoris Antoniou, Guido Governa...
JAIR
2012
254views Hardware» more  JAIR 2012»
11 years 10 months ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...