Sciweavers

2623 search results - page 405 / 525
» Hoare Logic in the Abstract
Sort
View
POPL
1995
ACM
15 years 1 months ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
JUCS
2006
94views more  JUCS 2006»
14 years 9 months ago
UML-Based Modeling of Data-oriented WEB Applications
Abstract: Recently a growing demand has arisen for methods for the development of smalland medium scale Web Information Systems (WIS). Web applications are being built in a rapidly...
Attila Adamkó
AMAI
2000
Springer
14 years 9 months ago
A prospective on mathematics and artificial intelligence: Problem solving=Modeling+Theorem proving
This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I...
Harvey J. Greenberg
CACM
1998
110views more  CACM 1998»
14 years 9 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
NDJFL
1998
105views more  NDJFL 1998»
14 years 9 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau