Sciweavers

3119 search results - page 262 / 624
» General Default Logic
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002
ENTCS
2008
128views more  ENTCS 2008»
15 years 6 months ago
Algebraic Stuttering Simulations
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
Narciso Martí-Oliet, José Meseguer, ...
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 6 months ago
Redesigning Decision Matrix Method with an indeterminacy-based inference process
For academics and practitioners concerned with computers, business and mathematics, one central issue is supporting decision makers. In this paper, we propose a generalization of ...
Jose L. Salmeron, Florentin Smarandache
IPL
2006
99views more  IPL 2006»
15 years 6 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
TJS
2008
98views more  TJS 2008»
15 years 6 months ago
Mapping functions and data redistribution for parallel files
A parallel file may be physically stored on several independent disks and logically partitioned by several processors. This paper presents general algorithms for mapping between t...
Florin Isaila, Walter F. Tichy