509 search results - page 13 / 102 » On the completeness of compositional reasoning methods |
122
click to vote
TACAS
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
GCC
2003
Springer
15 years 2 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
BIRTHDAY
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
ICTAI
1996
IEEE
15 years 1 months ago
1996
IEEE
In this paper we propose a general approach for reasoning in space. The approach is composed of a set of two general constraints to govern the spatial relationships between object...
101
click to vote
ECAI
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Representing and reasoning about orientation information is an important aspect of qualitative spatial reasoning. We present a novel approach for dealing with intrinsic o...