Sciweavers

3119 search results - page 533 / 624
» General Default Logic
Sort
View
112
Voted
IANDC
2006
102views more  IANDC 2006»
15 years 25 days ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
98
Voted
IJDAR
2006
103views more  IJDAR 2006»
15 years 24 days ago
Table-processing paradigms: a research survey
Tables are a ubiquitous form of communication. While everyone seems to know what a table is, a precise, analytical definition of "tabularity" remains elusive because some...
David W. Embley, Matthew Hurst, Daniel P. Lopresti...
101
Voted
JIIS
2008
89views more  JIIS 2008»
15 years 24 days ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
155
Voted
JODS
2008
424views Data Mining» more  JODS 2008»
15 years 24 days ago
Semantically Processing Parallel Colour Descriptions
Information integration and retrieval are useful tasks in many information systems. In these systems, it is far from an easy task to directly integrate information from natural lan...
Shenghui Wang, Jeff Z. Pan
JUCS
2008
166views more  JUCS 2008»
15 years 23 days ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn