Sciweavers

2529 search results - page 36 / 506
» The Logical Structure of Binding
Sort
View
CSL
2005
Springer
15 years 3 months ago
The Complexity of Independence-Friendly Fixpoint Logic
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedd...
Julian C. Bradfield, Stephan Kreutzer
JELIA
1998
Springer
15 years 2 months ago
A Resolution Calculus for Dynamic Semantics
Appeared in: Dix, J., del Cerro, F. L., and Furbach, U., editors, Logics in Artificial Intelligence (JELIA'98), Lecture Notes in Artificial Intelligence 1489, Springer, pages...
Christof Monz, Maarten de Rijke
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 4 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
JOLLI
2006
86views more  JOLLI 2006»
14 years 9 months ago
Types as Graphs: Continuations in Type Logical Grammar
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
Chris Barker, Chung-chieh Shan
CLEF
2008
Springer
14 years 11 months ago
Combining Logic and Machine Learning for Answering Questions
Abstract. LogAnswer is a logic-oriented question answering system developed by the AI research group at the University of Koblenz-Landau and by the IICS at the University of Hagen....
Ingo Glöckner, Björn Pelzer