20 papers:
ICFP-2012-StewartBA #proving #theorem proving- Verified heap theorem prover by paramodulation (GS, LB, AWA), pp. 3–14.
IJCAR-2012-Schulz- Fingerprint Indexing for Paramodulation and Rewriting (SS), pp. 477–483.
IJCAR-2006-Paskevich #lazy evaluation- Connection Tableaux with Lazy Paramodulation (AP), pp. 112–124.
IJCAR-2004-BofillR #order- Redundancy Notions for Paramodulation with Non-monotonic Orderings (MB, AR), pp. 107–121.
CADE-2002-BofillR #order- Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation (MB, AR), pp. 456–470.
ICALP-2001-BofillG #on the- On the Completeness of Arbitrary Selection Strategies for Paramodulation (MB, GG), pp. 951–962.
LICS-2000-GodoyN- Paramodulation with Built-in Abelian Groups (GG, RN), pp. 413–424.
CADE-1999-Benzmuller #higher-order- Extensional Higher-Order Paramodulation and RUE-Resolution (CB), pp. 399–413.
LICS-1999-BofillGNR #order- Paramodulation with Non-Monotonic Orderings (MB, GG, RN, AR), pp. 225–233.
LICS-1996-Nieuwenhuis #decidability- Basic Paramodulation and Decidable Theories (Extended Abstract) (RN), pp. 473–482.
LICS-1995-Lynch- Paramodulation without Duplication (CL), pp. 167–177.
CADE-1992-BachmairGLS- Basic Paramodulation and Superposition (LB, HG, CL, WS), pp. 462–476.
RTA-1991-SnyderL- Goal Directed Strategies for Paramodulation (WS, CL), pp. 150–161.
CADE-1990-BachmairG #on the #order #strict- On Restrictions of Ordered Paramodulation with Simplification (LB, HG), pp. 427–441.
CADE-1990-Benanav- Simultaneous Paramodulation (DB), pp. 442–455.
RTA-1989-Bachmair #normalisation #proving- Proof Normalization for Resolution and Paramodulation (LB), pp. 15–28.
JICSCP-1988-Holldobler88- From Paramodulation to Narrowing (SH), pp. 327–342.
CADE-1986-WosM- Negative Paramodulation (LW, WM), pp. 229–239.
CADE-1980-GloessL #algorithm- Adding Dynamic Paramodulation to Rewrite Algorithms (PYG, JPHL), pp. 195–207.
CADE-1980-WosOH #named #refinement- Hyperparamodulation: A Refinement of Paramodulation (LW, RAO, LJH), pp. 208–219.