Sciweavers

509 search results - page 39 / 102
» On the completeness of compositional reasoning methods
Sort
View
AUSAI
1997
Springer
14 years 1 months ago
On the Relation between Interpreted Systems and Kripke Models
Abstract. We compare Kripke models and hypercube systems, a simpli ed notion of Interpreted Systems, as semantic structures for reasoning about knowledge. Our method is to de ne a ...
Alessio Lomuscio, Mark Ryan
IJIS
2002
86views more  IJIS 2002»
13 years 8 months ago
Dynamics and control in component-based agent models
Dynamics are an important aspect of agent models. Control of dynamics requires specific methods of specification that have their own specific semantics. This paper addresses speci...
Frances M. T. Brazier, Catholijn M. Jonker, Jan Tr...
ESOP
2006
Springer
14 years 15 days ago
Bisimulations for Untyped Imperative Objects
We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisim...
Vasileios Koutavas, Mitchell Wand
WISE
2005
Springer
14 years 2 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
ALP
1990
Springer
14 years 27 days ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar