Sciweavers

2189 search results - page 9 / 438
» A Graded Applicability of Rules
Sort
View
CADE
2006
Springer
13 years 11 months ago
Presburger Modal Logic Is PSPACE-Complete
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
Stéphane Demri, Denis Lugiez
JAPLL
2010
133views more  JAPLL 2010»
13 years 6 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
ECEASST
2008
60views more  ECEASST 2008»
13 years 7 months ago
Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
Leen Lambers, Hartmut Ehrig, Gabriele Taentzer
IAJIT
2006
92views more  IAJIT 2006»
13 years 7 months ago
A Rule-Based Extensible Stemmer for Information Retrieval with Application to Arabic
: This paper presents a new and extensible method for information retrieval and content analysis in natural languages (NL). The proposed method is stem-based; stems are extracted b...
Haidar Harmanani, Walid Keirouz, Saeed Raheel