default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 162
Volume 162, Numbers 1-2, October/November 2000
- John K. Slaney:
Introduction. 1-2 - Qing Guo, Paliath Narendran, David A. Wolfram
:
Complexity of Nilpotent Unification and Matching Problems. 3-23 - Miki Hermann, Phokion G. Kolaitis:
Unification Algorithms Cannot Be Combined in Polynomial Time. 24-42 - Olivier Roussel, Philippe Mathieu:
The Achievement of Knowledge Bases by Cycle Search. 43-58 - Jörg Denzinger, Stephan Schulz:
Automatic Acquisition of Search Control Knowledge from Multiple Proof Attempts. 59-79 - David A. Basin, Seán Matthews:
Structuring Metatheory on Inductive Definitions. 80-95 - Christoph Walther, Thomas Kolbe:
On Terminating Lemma Speculations. 96-116 - Giuseppe De Giacomo, Fabio Massacci:
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL. 117-137 - Heribert Schütz, Tim Geisler:
Efficient Model Generation through Compilation. 138-157 - Fausto Giunchiglia, Roberto Sebastiani:
Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m). 158-178 - Tai Joon Park, Allen Van Gelder:
Partitioning Methods for Satisfiability Testing on Large Formulas. 179-184 - Gernot Salzer:
Optimal Axiomatizations of Finitely Valued Logics. 185-205 - Saturnino F. Luz-Filho:
Using Tableaux to Automate the Lambek and Other Categorial Calculi. 206-225 - Christoph Kreitz, Stephan Schmitt:
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems. 226-254 - Uwe Egly, Thomas Rath:
Practically Useful Variants of Definitional Translations to Normal Form. 255-264
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-08 09:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
