Sciweavers

903 search results - page 17 / 181
» Completeness Results for Memory Logics
Sort
View
AML
2010
96views more  AML 2010»
13 years 7 months ago
Implicational (semilinear) logics I: a new hierarchy
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
Petr Cintula, Carles Noguera
IGPL
2011
13 years 2 months ago
On representable ordered residuated semigroups
We show that the equational theory of representable lattice-ordered residuated semigroups is not finitely axiomatizable. We apply this result to the problem of completeness of su...
Szabolcs Mikulás
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
14 years 1 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
CADE
2010
Springer
13 years 8 months ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
IANDC
2007
132views more  IANDC 2007»
13 years 7 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza