Sciweavers

6 search results - page 1 / 2
» A Decomposition Rule for Decision Procedures by Resolution-B...
Sort
View
LPAR
2004
Springer
14 years 23 days ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
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
TABLEAUX
2009
Springer
14 years 1 months ago
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
Renate A. Schmidt, Dmitry Tishkovsky
TYPES
1998
Springer
13 years 11 months ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
Thomas Kleymann
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