Sciweavers

396 search results - page 5 / 80
» Combining decision procedures for the reals
Sort
View
CADE
2004
Springer
14 years 10 months ago
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
Yevgeny Kazakov, Hans de Nivelle
CADE
1998
Springer
14 years 2 months ago
A Resolution Decision Procedure for the Guarded Fragment
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
Hans de Nivelle
ENTCS
2006
124views more  ENTCS 2006»
13 years 9 months ago
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
Shuvendu K. Lahiri, Madanlal Musuvathi
CADE
2006
Springer
14 years 10 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
LPAR
2004
Springer
14 years 3 months 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