Sciweavers

5550 search results - page 104 / 1110
» Different Approaches to Proof Systems
Sort
View
DLOG
2004
15 years 7 months ago
Towards Explaining Semantic Matching
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
Deborah L. McGuinness, Pavel Shvaiko, Fausto Giunc...
ISORC
1998
IEEE
15 years 10 months ago
Compositional Specification and Structured Verification of Hybrid Systems in cTLA
Many modern chemical plants have to be modelled as complex hybrid systems consisting of various continuous and event-discrete components. Besides of the modular and easy-to-read s...
Peter Herrmann, Günter Graw, Heiko Krumm
IJCAI
1989
15 years 7 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien
HYBRID
2004
Springer
15 years 11 months ago
Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems
Abstract. In this paper we present algorithms and tools for fast and efficient reachability analysis, applicable to continuous and hybrid systems. Most of the work on reachability ...
Amit Bhatia, Emilio Frazzoli
PODC
2010
ACM
15 years 10 months ago
Brief announcement: anonymity and trust in distributed systems
In this paper, we present a framework for achieving anonymity and trust, two seemingly contradictory properties, in distributed systems. Our approach builds on webs of trust, a we...
Michael Backes, Stefan Lorenz, Matteo Maffei, Kim ...