Resolution Theorem Proving (2001)

by Leo Bachmair , Harald Ganzinger
Citations:153 - 1 self

Documents Related by Co-Citation

56 A Superposition Decision Procedure for the Guarded Fragment with Equality – Harald Ganzinger, Hans De Nivelle - 1999
90 On Generating Small Clause Normal Forms – Andreas Nonnengart, Georg Rock, Christoph Weidenbach - 1998
199 Rewrite-based equational theorem proving with selection and simplification – L Bachmair, H Ganzinger - 1994
45 T.: Resolution decision procedures – C G Fermüller, A Leitsch, U Hustadt, Tammet - 2001
74 Theorem Proving with Ordering and Equality Constrained Clauses – Robert Nieuwenhuis, Albert Rubio - 1995
88 SPASS: Combining Superposition, Sorts and Splitting – Christoph Weidenbach - 1999
131 Complexity Results and Practical Algorithms for Logics in Knowledge Representation – Stephan Tobies - 2001
178 A Structure-Preserving Clause Form Translation – D Plaisted, S Greenbaum - 1986
1526 V.: Foundations of Databases – S Abiteboul, R Hull, Vianu - 1995
266 The Classical Decision Problem – E Börger, E Grädel, Y Gurevich - 1996
30 Resolution Strategies as Decision Procedures – W H J Jr - 1976
156 Practical reasoning for very expressive description logics – Ian Horrocks - 2000
208 Disjunctive Datalog – Thomas Eiter, Georg Gottlob, Heikki Mannila - 1997
68 Basic Paramodulation – Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder - 1995
126 Reducing SHIQ − Description Logic to Disjunctive Datalog Programs – Ullrich Hustadt - 2004
289 Pushing the EL envelope – Franz Baader, Sebastian Brand, Carsten Lutz - 2005
135 Ontology Reasoning in the SHOQ(D) Description Logic – Ian Horrocks, Ulrike Sattler - 2001
145 On the Relative Expressiveness of Description Logics and Predicate Logics – Alex Borgida - 1996
244 On the Decidability of Query Containment under Constraints – Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini - 1998