|
|
Journals in DBLP
Inf. Comput.
2000, volume: 162, number: 1-2
- John K. Slaney
Introduction. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:1-2 [Journal]
- Qing Guo, Paliath Narendran, David A. Wolfram
Complexity of Nilpotent Unification and Matching Problems. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:3-23 [Journal]
- Miki Hermann, Phokion G. Kolaitis
Unification Algorithms Cannot Be Combined in Polynomial Time. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:24-42 [Journal]
- Olivier Roussel, Philippe Mathieu
The Achievement of Knowledge Bases by Cycle Search. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:43-58 [Journal]
- Jörg Denzinger, Stephan Schulz
Automatic Acquisition of Search Control Knowledge from Multiple Proof Attempts. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:59-79 [Journal]
- David A. Basin, Seán Matthews
Structuring Metatheory on Inductive Definitions. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:80-95 [Journal]
- Christoph Walther, Thomas Kolbe
On Terminating Lemma Speculations. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:96-116 [Journal]
- Giuseppe De Giacomo, Fabio Massacci
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:117-137 [Journal]
- Heribert Schütz, Tim Geisler
Efficient Model Generation through Compilation. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:138-157 [Journal]
- Fausto Giunchiglia, Roberto Sebastiani
Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m). [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:158-178 [Journal]
- Tai Joon Park, Allen Van Gelder
Partitioning Methods for Satisfiability Testing on Large Formulas. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:179-184 [Journal]
- Gernot Salzer
Optimal Axiomatizations of Finitely Valued Logics. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:185-205 [Journal]
- Saturnino F. Luz-Filho
Using Tableaux to Automate the Lambek and Other Categorial Calculi. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:206-225 [Journal]
- Christoph Kreitz, Stephan Schmitt
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:226-254 [Journal]
- Uwe Egly, Thomas Rath
Practically Useful Variants of Definitional Translations to Normal Form. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2000, v:162, n:1-2, pp:255-264 [Journal]
|
