3690 search results - page 311 / 738 » Computation with classical sequents |
120
click to vote
CG
2002
Springer
15 years 5 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
145
click to vote
JASSS
2002
15 years 5 months ago
2002
When does opinion formation within an interacting group lead to consensus, polarization or fragmentation? The article investigates various models for the dynamics of continuous opi...
121
click to vote
DCC
1999
IEEE
15 years 5 months ago
1999
IEEE
We identify the points of PG(2, q) with the directions of lines in GF(q3), viewed as a 3dimensional affine space over GF(q). Within this framework we associate to a unital in PG(2...
147
click to vote
LOGCOM
2002
15 years 5 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
164
click to vote
JSS
1998
15 years 5 months ago
1998
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...