Sciweavers

100 search results - page 1 / 20
» Strict Basic Superposition
Sort
View
CADE
1998
Springer
13 years 11 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
IANDC
2008
116views more  IANDC 2008»
13 years 7 months ago
Deciding expressive description logics in the framework of resolution
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
JAR
2007
77views more  JAR 2007»
13 years 7 months ago
Superposition-based Equality Handling for Analytic Tableaux
We present a variant of the basic ordered superposition rules to handle equality in an analytic free-variable tableau calculus. We prove completeness of this calculus by an adaptat...
Martin Giese
VTC
2008
IEEE
14 years 1 months ago
Transmission Strategies for Parallel Relay Networks Based on Superposition Coding
—This paper is concerned with the transmission strategies and relay selection for decode-and-forward parallel relay networks (PRNs) based on superposition coding. Our focus is on...
Jianzhong Huang 0002, Yang Yang, Xinmei Wang, Peng...
CADE
2006
Springer
14 years 7 months ago
A Resolution-Based Decision Procedure for SHOIQ
We present a resolution-based decision procedure for the description logic SHOIQ--the logic underlying the Semantic Web ontology language OWL-DL. Our procedure is goal-oriented, an...
Yevgeny Kazakov, Boris Motik