1536 search results - page 167 / 308 » The Underlying Logic of Hoare Logic |
166
click to vote
DLOG
2003
15 years 7 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
169
click to vote
FMOODS
2003
15 years 7 months ago
2003
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several ca...
162
click to vote
SFP
2004
15 years 7 months ago
2004
Abstract: Forms are parts of a graphical user interface (GUI) that show a (structured) value and allow the user to update it. Some forms express a choice between two or more (struc...
160
click to vote
UAI
1989
15 years 7 months ago
1989
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
137
click to vote
APAL
2007
15 years 6 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...