Results 11  20
of
685
A Modal Logic for KLAIM
, 2000
"... . Klaim is an experimental programming language that supports a programming paradigm where both processes and data can be moved across dierent computing environments. The language relies on the use of explicit localities, and on allocation environments that associate logical localities to physical s ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
with a consistent and complete proof system that enables one to prove properties of mobile systems. Keywords: Mobile Code Languages, Temporal Logics of Programs, Coordination Models. 1 Introduction The increasing use of wide area networks, especially the World Wide Web, is calling for new programming
A deontic logic for reasoning about confidentiality
"... This paper presents a deontic logic \Sigma for reasoning about per mission or prohibition to know some parts of the datab!ase content in the context of a multilevel confidentiality policy. The most important logical features in the definition of a multi level policy are that each confidentiality ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
by nonstandard modal models. The corresponding axiomatics is also presented in the paper and its soundness and completeness have been proved. A limitation of the \Sigma logic is that sentences in the scope of modalities are sentences of Propositional Calculus. Finally, it is shown how the logic can
Rules for Trace Consistent Reasoning
"... Formulas of temporal logic which cannot distinguish between different interleavings of the same run are said to be trace consistent. So called partialorder methods can be applied for verification of such formulas, since checking such a property over an equivalence class of runs reduces to checking ..."
Abstract
 Add to MetaCart
it for one representative. In this paper, we present inference rules that typify this kind of reasoning. The rules lead us to a complete axiomatization of a linear time temporal logic, all formulas of which are trace consistent. The axiomatization is presented in a layered manner so that we can attempt
Consistency Reasoning in LatticeBased Fuzzy Description Logics
"... Fuzzy Description Logics have been widely studied as a formalism for representing and reasoning with vague knowledge. One of the most basic reasoning tasks in (fuzzy) Description Logics is to decide whether an ontology representing a knowledge domain is consistent. Surprisingly, not much is known ab ..."
Abstract
 Add to MetaCart
Fuzzy Description Logics have been widely studied as a formalism for representing and reasoning with vague knowledge. One of the most basic reasoning tasks in (fuzzy) Description Logics is to decide whether an ontology representing a knowledge domain is consistent. Surprisingly, not much is known
On Completeness of Logics Enriched with Transitive Closure Modality
"... We give a sufficient condition for Kripke completeness of the extension of a modal logic with the transitive closure modality. More precisely, we show that if a logic is canonical and admits what we call definable filtration (ADF), then such an extension is complete (and again ADF). The transitive c ..."
Abstract
 Add to MetaCart
We give a sufficient condition for Kripke completeness of the extension of a modal logic with the transitive closure modality. More precisely, we show that if a logic is canonical and admits what we call definable filtration (ADF), then such an extension is complete (and again ADF). The transitive
Selfdetermination and persistence in a reallife setting: Toward a motivational model of high school dropout.
 Journal of Personality and Social Psychology,
, 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract

Cited by 183 (19 self)
 Add to MetaCart
determination has been hypothesized to be associated with enhanced psychological functioning In addition, much experimental (laboratory) research reveals that individuals who are induced to become externally regulated persist much less than those who are intrinsically motivated (see Deci & Ryan, 1985, for a
Interval propagation to reason about sets: definition and implementation of a practical language
 CONSTRAINTS
, 1997
"... Local consistency techniques have been introduced in logic programming in order to extend the application domain of logic programming languages. The existing languages based on these techniques consider arithmetic constraints applied to variables ranging over nite integer domains. This makes difficu ..."
Abstract

Cited by 119 (8 self)
 Add to MetaCart
difficult a natural and concise modelling as well as an efficient solving of a class of NPcomplete combinatorial search problems dealing with sets. To overcome these problems, we propose a solution which consists in extending the notion of integer domains to that of set domains (sets of sets). We specify a
A critical role for the right frontoinsular cortex in switching between centralexecutive and defaultmode networks.
 Proc Natl Acad Sci USA
, 2008
"... Cognitively demanding tasks that evoke activation in the brain's centralexecutive network (CEN) have been consistently shown to evoke decreased activation (deactivation) in the defaultmode network (DMN). The neural mechanisms underlying this switch between activation and deactivation of larg ..."
Abstract

Cited by 178 (1 self)
 Add to MetaCart
taskfree resting state. These results indicate that the rFIC is likely to play a major role in switching between distinct brain networks across task paradigms and stimulus modalities. Our findings have important implications for a unified view of network mechanisms underlying both exogenous
Bimodal Logics for Reasoning About Continuous Dynamics
 Advances in Modal Logic
, 2000
"... We study a propositional bimodal logic consisting of two S4 modalities and [a], together with the interaction axiom scheme #a## # #a##. In the intended semantics, the plain is given the McKinseyTarski interpretation as the interior operator of a topology, while the labelled [a] is given the ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We study a propositional bimodal logic consisting of two S4 modalities and [a], together with the interaction axiom scheme #a## # #a##. In the intended semantics, the plain is given the McKinseyTarski interpretation as the interior operator of a topology, while the labelled [a] is given
On the Restraining Power of Guards
 Journal of Symbolic Logic
, 1998
"... Guarded fragments of firstorder logic were recently introduced by Andr'eka, van Benthem and N'emeti; they consist of relational firstorder formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many proposit ..."
Abstract

Cited by 153 (3 self)
 Add to MetaCart
Guarded fragments of firstorder logic were recently introduced by Andr'eka, van Benthem and N'emeti; they consist of relational firstorder formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many
Results 11  20
of
685