Sciweavers

37 search results - page 2 / 8
» The Efficiency of Resolution and Davis--Putnam Procedures
Sort
View
DAM
1999
100views more  DAM 1999»
13 years 8 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
CADE
2006
Springer
14 years 9 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
FTP
1998
Springer
14 years 28 days ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt
MOC
2002
87views more  MOC 2002»
13 years 8 months ago
On the resolution of relative Thue equations
An efficient algorithm is given for the resolution of relative Thue equations. The essential improvement is the application of an appropriate version of Wildanger's enumeratio...
István Gaál, Michael Pohst
CADE
2008
Springer
14 years 9 months ago
Bit Inference
Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage...
Nachum Dershowitz