Sciweavers

265 search results - page 51 / 53
» Weakly Algebraizable Logics
Sort
View
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang
JAIR
2008
126views more  JAIR 2008»
13 years 7 months ago
Extended RDF as a Semantic Foundation of Rule Markup Languages
Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts based on base...
Anastasia Analyti, Grigoris Antoniou, Carlos Viega...
AAI
2000
138views more  AAI 2000»
13 years 7 months ago
Compositional Design and Reuse of a Generic Agent Model
This paper introduces a formally specified design of a compositional generic agent model (GAM). This del abstracts from specific application domains; it provides a unified formal ...
Frances M. T. Brazier, Catholijn M. Jonker, Jan Tr...
LOGCOM
2010
143views more  LOGCOM 2010»
13 years 5 months ago
Vietoris Bisimulations
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
Nick Bezhanishvili, Gaëlle Fontaine, Yde Vene...
PODC
1994
ACM
13 years 11 months ago
Using Belief to Reason about Cache Coherence
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
Lily B. Mummert, Jeannette M. Wing, Mahadev Satyan...