Sciweavers

979 search results - page 65 / 196
» Footprints in Local Reasoning
Sort
View
DLOG
2011
12 years 11 months ago
Bidirectional Reachability-Based Modules
We introduce an algorithm for MinA extraction in EL based on bidirectional reachability. We obtain a significant reduction in the size of modules extracted at almost no additional...
Riku Nortje, Arina Britz, Thomas Andreas Meyer
STACS
2010
Springer
14 years 2 months ago
Named Models in Coalgebraic Hybrid Logic
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
Lutz Schröder, Dirk Pattinson
SAC
2003
ACM
14 years 27 days ago
Are Multiagent Algorithms Relevant for Real Hardware? A Case Study of Distributed Constraint Algorithms
Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigatio...
Paul Scerri, Pragnesh Jay Modi, Wei-Min Shen, Mili...
CSL
2008
Springer
13 years 9 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe
GIS
2002
ACM
13 years 7 months ago
Handling semantic heterogeneities using declarative agreements
The focus of this paper is on interoperability issues to achieve data integration in distributed databases for geographic applications. Our concrete application is in the context ...
Isabel F. Cruz, Afsheen Rajendran, William Sunna, ...