1712 search results - page 55 / 343 » A Computational Approach to Binding Theory |
102
click to vote
LPNMR
2007
Springer
15 years 6 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
ILP
2000
Springer
15 years 3 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
EUROSSC
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. In the domain of ubiquitous computing, the ability to identify the occurrence of situations is a core function of being ’contextaware’. Given the uncertain nature of ...
FECS
2006
15 years 1 months ago
2006
Data Communication and Computer Networking is a traditional undergraduate CS course. Classic teaching focuses on communication protocol and algorithm analysis, plus socket programm...
ECIS
2003
15 years 1 months ago
2003
Research problems in ICT networks often comprise coordination problems of information infrastructures and require state-of-the-art methods of coping with complex system dynamics. ...