Sciweavers

29 search results - page 4 / 6
» Model checking the basic modalities of CTL with Description ...
Sort
View
DEON
2004
Springer
13 years 11 months ago
Designing a Deontic Logic of Deadlines
This paper studies the logic of a dyadic modal operator for being obliged to meet a condition ρ before a condition δ becomes true. Starting from basic intuitions we arrive at a s...
Jan Broersen, Frank Dignum, Virginia Dignum, John-...
FSTTCS
2004
Springer
13 years 11 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
DLOG
2003
13 years 7 months ago
Extensions to Description Logics
This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics a...
Franz Baader, Ralf Küsters, Frank Wolter
APWEB
2011
Springer
13 years 25 days ago
A Tableau Algorithm for Paraconsistent and Nonmonotonic Reasoning in Description Logic-Based System
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description lo...
Xiaowang Zhang, Zuoquan Lin, Kewen Wang
JOLLI
2008
95views more  JOLLI 2008»
13 years 5 months ago
Relational Modality
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
Kathrin Glüer, Peter Pagin