417 search results - page 37 / 84 » Results on Reasoning about Updates in Transaction Logic |
CADE
2005
Springer
16 years 26 days ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
108
Voted
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Interactions between agents in an open system such as the Internet require a significant degree of flexibility. A crucial aspect of the development of such methods is the notion o...
102
Voted
DASFAA
2007
IEEE
15 years 4 months ago
2007
IEEE
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
IJCAI
2007
15 years 2 months ago
2007
We combine the modal logic S5 with the description logic (DL) ALCQI. In this way, we obtain a multi-dimensional DL, S5ALCQI, whose purpose is reasoning about change. S5ALCQI is ca...
111
Voted
CADE
2003
Springer
16 years 26 days ago
2003
Springer
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...