1220 search results - page 60 / 244 » Restricting grammatical complexity |
STACS
1993
Springer
13 years 11 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
CISSE
2009
Springer
13 years 11 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
AMW
2010
13 years 9 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
AAAI
2008
13 years 10 months ago
2008
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...
ICAI
2004
13 years 9 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...