611 search results - page 22 / 123 » Yuri, Logic, and Computer Science |
106
click to vote
TCS
1998
14 years 9 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
120
click to vote
PODC
2012
ACM
13 years 4 days ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
ICTCS
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
— The relationship between subsymbolic neural networks and symbolic logical systems is discussed from the point of view of the account of computational science by Paul Humphreys ...