611 search results - page 88 / 123 » Yuri, Logic, and Computer Science |
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
103
click to vote
ACMSE
1995
ACM
15 years 1 months ago
1995
ACM
{ Traditional computer applications have been designed to be run by one user at a time who does some work in a single medium, such as ASCII text, and very little regard has been gi...
111
click to vote
DALT
2005
Springer
15 years 3 months ago
2005
Springer
Developing applications that make effective use of machine-readable knowledge sources as promised by the Semantic Web vision is attracting much of current research interest; this v...
IJCAI
2003
14 years 11 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
IGPL
2008
14 years 9 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...