Sciweavers

1220 search results - page 119 / 244
» Restricting grammatical complexity
Sort
View
JOLLI
2006
76views more  JOLLI 2006»
13 years 7 months ago
A Modal Interpretation of the Logic of Interrogation
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniq...
Rani Nelken, Chung-chieh Shan
NJC
2006
102views more  NJC 2006»
13 years 7 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
TKDE
2008
121views more  TKDE 2008»
13 years 7 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
AI
2002
Springer
13 years 7 months ago
Conditional independence in propositional logic
Independence--the study of what is relevant to a given problem of reasoning--is an important AI topic. In this paper, we investigate several notions of conditional independence in...
Jérôme Lang, Paolo Liberatore, Pierre...
CAGD
2000
61views more  CAGD 2000»
13 years 7 months ago
Efficient evaluation of triangular B-spline surfaces
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
Michael Franssen, Remco C. Veltkamp, Wieger Wessel...