550 search results - page 33 / 110 » Context Semantics, Linear Logic and Computational Complexity |
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
EUSFLAT
2009
14 years 7 months ago
2009
This paper presents a new framework to model an assessment process for a complex and multidimensional syndrome such as depression. Since the measurements of depression are inherent...
103
click to vote
WISE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
AIED
2007
Springer
15 years 3 months ago
2007
Springer
We compare the relative utility of different automatically computable linguistic feature sets for modeling student learning in computer dialogue tutoring. We use the PARADISE frame...