4401 search results - page 278 / 881 » Computing with Default Logic |
158
click to vote
LICS
2006
IEEE
16 years 18 days ago
2006
IEEE
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
171
Voted
CIE
2005
Springer
16 years 4 days ago
2005
Springer
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
168
click to vote
POLICY
2005
Springer
16 years 2 days ago
2005
Springer
We describe a policy language and implement its associated proof checking system. In our system, agents can distribute data along with usage policies in a decentralized architectu...
161
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms s...
143
click to vote
ICES
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a systematic procedure for the synthesis and minimisation of digital circuits using propositional satisfiability. We encode the truth table into a canonical s...