4573 search results - page 491 / 915 » Automated Reasoning |
179
click to vote
CSL
2005
Springer
16 years 13 days ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
154
click to vote
CSL
2005
Springer
16 years 13 days ago
2005
Springer
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
165
click to vote
ECSQARU
2005
Springer
16 years 12 days ago
2005
Springer
In this paper, we investigate consonant random sets from the point of view of lattice theory. We introduce a new definition of consonancy and study its relationship with possibili...
157
click to vote
ICCBR
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. In this paper, we propose an approach to attach semantic annotations to textual cases for their representation. To achieve this goal, a framework that combines machine le...
136
click to vote
LPAR
2005
Springer
16 years 11 days ago
2005
Springer
In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system ...