Sciweavers

3032 search results - page 176 / 607
» Description Logic Rules
Sort
View
72
Voted
FUIN
2007
93views more  FUIN 2007»
15 years 19 days ago
Davis-Putnam Style Rules for Deciding Property S
Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ ∩ e = ∅, for all e ∈ E and f ⊆ σ, for all f âˆ...
Robert Cowen, Adam Kolany
DLOG
2010
14 years 10 months ago
Towards Formal Comparison of Ontology Linking, Mapping and Importing
Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relation...
Martin Homola, Luciano Serafini
104
Voted
CADE
2008
Springer
16 years 1 months ago
Multi-completion with Termination Tools (System Description)
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, A...
BIOTECHNO
2008
IEEE
15 years 7 months ago
Mathematical Description of Biological Structures and Mechanisms
A new formalism and approach to describing cellular and molecular processes and structures is introduced, designed to support the creation of knowledge bases of molecular and cell...
H. Joel Jeffrey
AML
2007
95views more  AML 2007»
15 years 24 days ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek