2152 search results - page 205 / 431 » On Automating the Calculus of Relations |
140
click to vote
LICS
2006
IEEE
16 years 16 days ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
171
click to vote
LICS
2005
IEEE
16 years 2 days ago
2005
IEEE
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
151
click to vote
TACAS
2005
Springer
15 years 12 months ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
166
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
147
click to vote
ICSM
2003
IEEE
15 years 11 months ago
2003
IEEE
“Nightly/daily building and smoke testing” have become widespread since they often reveal bugs early in the software development process. During these builds, software is comp...