4617 search results - page 599 / 924 » Automation of Diagrammatic Reasoning |
218
Voted
ICLP
1995
Springer
15 years 11 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
186
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
172
Voted
LICS
1995
IEEE
15 years 11 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
177
click to vote
PLILP
1995
Springer
15 years 11 months ago
1995
Springer
We use Girard's linear logic (LL) to produce a semantics for Gamma, a multiset transformation language. The semantics improves on the existing structured operational semantics...
186
Voted
ICLP
1991
Springer
15 years 11 months ago
1991
Springer
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...