Sciweavers

144 search results - page 9 / 29
» Complexity Results for Modal Dependence Logic
Sort
View
KGC
1993
Springer
13 years 11 months ago
Nonmonotonic Reasoning is Sometimes Simpler
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
Grigori Schwarz, Miroslaw Truszczynski
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
LOGCOM
2007
97views more  LOGCOM 2007»
13 years 7 months ago
Termination for Hybrid Tableaus
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
Thomas Bolander, Patrick Blackburn
CADE
2010
Springer
13 years 8 months ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
TOH
2010
78views more  TOH 2010»
13 years 5 months ago
Optimum Information Transfer Rates for Communication through Haptic and Other Sensory Modalities
—This paper is concerned with investigating the factors that contribute to optimizing information transfer (IT) rate in humans. With an increasing interest in designing complex h...
Hong Z. Tan, Charlotte M. Reed, Nathaniel I. Durla...