Sciweavers

1549 search results - page 295 / 310
» On the rules of intermediate logics
Sort
View
RTA
1995
Springer
13 years 11 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
ESWS
2008
Springer
13 years 9 months ago
Contextual and Metadata-based Approach for the Semantic Annotation of Heterogeneous Documents
We present SHIRI-Annot an automatic ontology-driven and unsupervised approach for the semantic annotation of documents which contain well structured parts and not well structured o...
Mouhamadou Thiam, Nathalie Pernelle, Nacéra...
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 7 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
SOCO
2002
Springer
13 years 7 months ago
Granular neural web agents for stock prediction
A granular neural Web-based stock prediction agent is developed using the granular neural network (GNN) that can discover fuzzy rules. Stock data sets are downloaded from www.yahoo...
Yan-Qing Zhang, Somasheker Akkaladevi, George J. V...
STACS
2007
Springer
14 years 1 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman