1391 search results - page 39 / 279 » Completeness of Neighbourhood Logic |
190
click to vote
DALT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We describe a model-checking based approach to verification of programs written in the agent programming language Dribble. We define a logic (an extension of the branch...
174
click to vote
LFCS
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
159
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
142
click to vote
CSR
2006
Springer
15 years 9 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
166
click to vote
SEMWEB
2009
Springer
16 years 19 days ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...