Filters








98,333 Hits in 4.5 sec

On the sequence of authorization policy transformations

Yun Bai, Yan Zhang, Vijay Varadharajan
2005 International Journal of Information Security  
Secondly, default authorizations could not be expressed.  ...  Our work starts with L s , a simple, but expressive language to specify certain sequence of authorization transformations.  ...  Jajodia et al [19, 20] proposed a logic language for expressing authorizations.  ... 
doi:10.1007/s10207-004-0069-1 fatcat:52e7laoapbaxbbvhozg5iwbdfe

Page 2195 of Mathematical Reviews Vol. , Issue 2000c [page]

2000 Mathematical Reviews  
In the present paper, we increase the expressive power of description logics by allowing for more complex roles in number restrictions.  ...  Moreover, if one wants to introduce this kind of reasoning in default logic and be consistent with it then an applicable default rule must also be applicable when reason- ing by cases.  ... 

Dynamic Delegation Based on Temporal Context

Ouarda Bettaz, Narhimene Boustia, Aicha Mokhtari
2016 Procedia Computer Science  
The description logic that we use for the re-formalization process is T-JClassic .  ...  In this paper we aim to consider the delegation dynamically based on temporal context, to this end we redefine delegation for OrBAC using temporal nonmonotonic description logic.  ...  Nonmonotonic description logic: Description logics are good formalisms for knowledge base representation 8 .  ... 
doi:10.1016/j.procs.2016.08.137 fatcat:phk4wxcaszeb3ezfpczuswn25y

Page 8383 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
Section 3 is concerned with the major semantic approaches to expressing con- ditional logics.  ...  “In conditional logic, the starting point is not to provide a gen- eral mechanism for nonmonotonic inference, but rather to provide a theory of sentences expressing default conditionals.  ... 

Page 4523 of Mathematical Reviews Vol. , Issue 97G [page]

1997 Mathematical Reviews  
This paper focuses on combining recursive function-free Horn rules with the expressive description logic W7ENA, and shows exactly when a hybrid language with decidable inference can be obtained.  ...  |-RI; Orsay) The limits on combining recursive Horn rules with description logics.  ... 

Page 5256 of Mathematical Reviews Vol. , Issue 2001H [page]

2001 Mathematical Reviews  
The new intensional operators for description of inferences by default are introduced with a formal semantics of allocative system type.”  ...  ,u(en)) with u(x) denoting the meaning of the expression x. For the web version of Mathematical Reviews, see http: //www.ams.org/mathscinet  ... 

DEFAULTS, CONTEXT, AND KNOWLEDGE: ALTERNATIVES FOR OWL-INDEXED KNOWLEDGE BASES

A. RECTOR
2003 Biocomputing 2004  
The new Web Ontology Language (OWL) and its Description Logic compatible sublanguage (OWL-DL) explicitly exclude defaults and exceptions, as do all logic based formalisms for ontologies.  ...  Default reasoning has always been one of the great strengths of Frame systems such as Protégé. Resolving this conflict requires analysis of the different uses for defaults and exceptions.  ...  The first three cases can be dealt with purely within the logic based ontology framework. The first can be dealt with in any description logic.  ... 
doi:10.1142/9789812704856_0022 fatcat:bppcyapw6nhpjkvs24vnzyrrsy

Defaults, context, and knowledge: alternatives for OWL-indexed knowledge bases

A Rector
2004 Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing  
The new Web Ontology Language (OWL) and its Description Logic compatible sublanguage (OWL-DL) explicitly exclude defaults and exceptions, as do all logic based formalisms for ontologies.  ...  Default reasoning has always been one of the great strengths of Frame systems such as Protégé. Resolving this conflict requires analysis of the different uses for defaults and exceptions.  ...  The first three cases can be dealt with purely within the logic based ontology framework. The first can be dealt with in any description logic.  ... 
pmid:14992506 fatcat:urqpmvhzivf2tno5pxwxtp3eku

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning

James Delgrande, Torsten Schaub, Hans Tompits, Kewen Wang
2004 Computational intelligence  
Here, we present an overview and classification for approaches to dealing with preference.  ...  A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy.  ...  Acknowledgements The authors would like to thank the anonymous referees for valuable com-  ... 
doi:10.1111/j.0824-7935.2004.00240.x fatcat:2athvzwyazgobgqki57falevsi

HEURISTICS FOR A DEFAULT LOGIC REASONING SYSTEM

PASCAL NICOLAS, FRÉDÉRIC SAUBION, IGOR STÉPHAN
2001 International journal on artificial intelligence tools  
Résumé en anglais In Artificial Intelligence, Default Logic is recognized as a powerful framework for knowledge representation when one has to deal with incomplete information.  ...  Today, some operational systems are able to deal with real world applications. However, finding a default logic extension in a practical way is not yet possible in whole generality.  ... 
doi:10.1142/s0218213001000635 fatcat:tkda6rvwd5fm3f4uxgtk6k2jy4

Page 2076 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
We mainly deal with default logic and circumscription, although we also consider autoepistemic logic, Theorist, and variants of default logic and circumscription.  ...  More- over, we deal with the ‘standard’ version of, for example, default logic and circumscription, and do not rely on prioritised versions, as do other approaches.  ... 

Preferential Semantics for Plausible Subsumption in Possibility Theory

Guilin Qi, Zhizheng Zhang
2013 Minds and Machines  
Finally, we show that our semantics for plausible subsumption can be reduced to standard semantics of an expressive description logic.  ...  In this paper, we propose several preferential semantics for plausible subsumption to deal with exceptions in description logic-based knowledge bases.  ...  The authors would like to thanks anonymous reviewers for their insightful comments, which are helpful to improve the quality of this paper.  ... 
doi:10.1007/s11023-012-9300-4 fatcat:ghvnkbcn7bcfxngjpt4rpovnsm

Explicity Using Default Knowledge in Concept Learning: An Extended Description Logics Plus Strict and Default Rules [chapter]

Véronique Ventos, Pierre Brézellec, Henry Soldano
2001 Lecture Notes in Computer Science  
In [9] , the authors present a framework for learning non-monotonic logic programs.  ...  The description logics used here, C-CLASSIC δ [23, 22] , extends C-CLASSIC with two non classical connectives (δ, ) used to represent default knowledge.  ... 
doi:10.1007/3-540-45402-0_13 fatcat:ql5nzh77krgdfhqenmvntqqwzu

Variable-Strength Conditional Preferences for Ranking Objects in Ontologies [chapter]

Thomas Lukasiewicz, Jörg Schellhase
2006 Lecture Notes in Computer Science  
Conditional preference bases consist of a description logic knowledge base and a finite set of variable-strength conditional preferences.  ...  They are inspired by Goldszmidt and Pearl's approach to default reasoning from conditional knowledge bases in System Z + .  ...  We thank the reviewers for their constructive comments, which helped to improve this work.  ... 
doi:10.1007/11762256_23 fatcat:ee4ht37atfb2botdwrwqarksre

Variable-strength conditional preferences for ranking objects in ontologies

Thomas Lukasiewicz, Jörg Schellhase
2007 Journal of Web Semantics  
Conditional preference bases consist of a description logic knowledge base and a finite set of variable-strength conditional preferences.  ...  They are inspired by Goldszmidt and Pearl's approach to default reasoning from conditional knowledge bases in System Z + .  ...  We thank the reviewers for their constructive comments, which helped to improve this work.  ... 
doi:10.1016/j.websem.2007.06.001 fatcat:md23q7pj6rf7vkas5gdnbr7zny
« Previous Showing results 1 — 15 out of 98,333 results