509 search results - page 34 / 102 » On the completeness of compositional reasoning methods |
108
Voted
ZUM
1997
Springer
15 years 1 months ago
1997
Springer
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
HRI
2006
ACM
15 years 3 months ago
2006
ACM
The essence of the signal-to-symbol problem consists of associating a symbolic description of an object (e.g., a chair) to a signal (e.g., an image) that captures the real object....
CCL
1994
Springer
15 years 1 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
DLOG
2007
15 years 3 days ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...