Sciweavers

499 search results - page 62 / 100
» LTL satisfiability checking
Sort
View
JCS
2006
118views more  JCS 2006»
14 years 11 months ago
Language based policy analysis in a SPKI Trust Management System
Abstract-- SPKI/SDSI is a standard for issuing authorization and name certificates. SPKI/SDSI can be used to implement a Trust Management System, where the policy for resource acce...
Arun K. Eamani, A. Prasad Sistla
JNSM
2006
78views more  JNSM 2006»
14 years 11 months ago
Edge-Cut Bounds on Network Coding Rates
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
Gerhard Kramer, Serap A. Savari
JOLLI
2002
92views more  JOLLI 2002»
14 years 11 months ago
A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...
Ani Nenkova
DLOG
2009
14 years 9 months ago
Validating Process Refinement with Ontologies
A crucial task in process management is the validation of process refinements. A process refinement is a process description in a more fine-grained representation. The refinement i...
Yuan Ren, Gerd Gröner, Jens Lemcke, Tirdad Ra...
DLOG
2009
14 years 9 months ago
Quasi-Classical Semantics for Expressive Description Logics
Abstract. Inconsistency handling in expressive description logics is an important problem because inconsistency may naturally occur in an open world. In this paper, we present the ...
Xiaowang Zhang, Guilin Qi, Yue Ma, Zuoquan Lin