Sciweavers

106 search results - page 8 / 22
» Light Logics and Optimal Reduction: Completeness and Complex...
Sort
View
LPAR
2010
Springer
13 years 5 months ago
SAT Encoding of Unification in EL
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
Franz Baader, Barbara Morawska
PPDP
2010
Springer
13 years 5 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer
TCS
2010
13 years 5 months ago
On the complexities of consistency checking for restricted UML class diagrams
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
Ken Kaneiwa, Ken Satoh
IANDC
2007
66views more  IANDC 2007»
13 years 7 months ago
Quantitative temporal logics over the reals: PSpace and below
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...
Carsten Lutz, Dirk Walther, Frank Wolter
NPL
2006
130views more  NPL 2006»
13 years 7 months ago
A Fast Feature-based Dimension Reduction Algorithm for Kernel Classifiers
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...