Sciweavers

342 search results - page 28 / 69
» Tableau Algorithms for Description Logics
Sort
View
LPAR
2010
Springer
13 years 6 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
ARITH
1999
IEEE
14 years 1 months ago
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication
A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm i...
Guy Even, Peter-Michael Seidel
JAPLL
2010
133views more  JAPLL 2010»
13 years 7 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
WWW
2003
ACM
14 years 9 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon
MST
2011
207views Hardware» more  MST 2011»
13 years 3 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey