4573 search results - page 556 / 915 » Automated Reasoning |
170
click to vote
ICLP
1995
Springer
15 years 8 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
158
click to vote
ICLP
1995
Springer
15 years 8 months ago
1995
Springer
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to...
148
click to vote
ICLP
1995
Springer
15 years 8 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...
136
click to vote
LICS
1997
IEEE
15 years 8 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 ...
129
Voted
LICS
1995
IEEE
15 years 8 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...