Automated Reasoning
暂无分享,去创建一个
[1] Uwe Waldmann,et al. Superposition for Divisible Torsion-Free Abelian Groups , 1998, CADE.
[2] Hans Jürgen Ohlbach. Abstraction Tree Indexing for Terms , 1990, ECAI.
[3] Robert Nieuwenhuis,et al. Solved Forms for Path Ordering Constraints , 1999, RTA.
[4] Harald Ganzinger,et al. Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..
[5] Mike Paterson,et al. Linear Unification , 1978, J. Comput. Syst. Sci..
[6] Claude Marché,et al. Normalized Rewriting: An Alternative to Rewriting Modulo a Set of Equations , 1996, J. Symb. Comput..
[7] Albert Rubio,et al. Basic Superposition is Complete , 1992, ESOP.
[8] William McCune,et al. ROO: A Parallel Theorem Prover , 1992, CADE.
[9] William McCune,et al. Logic Machine Architecture: Kernel Funtions , 1982, CADE.
[10] David A. Plaisted,et al. Replacement Rules with Definition Detection , 1998, FTP.
[11] Uwe Waldmann. Extending Reduction Orderings to ACU-Compatible Reduction Orderings , 1998, Inf. Process. Lett..
[12] Harald Ganzinger,et al. Ordered chaining calculi for first-order theories of transitive relations , 1998, JACM.
[13] Andrei Voronkov,et al. On the Evaluation of Indexing Techniques for Theorem Proving , 2001, IJCAR.
[14] Andrei Voronkov,et al. A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[15] Michaël Rusinowitch,et al. RPO Constraint Solving Is in NP , 1998, CSL.
[16] Albert Rubio,et al. Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..
[17] Uwe Waldmann. Superposition and Chaining for Totally Ordered Divisible Abelian Groups , 2001, IJCAR.
[18] Volker Sorge,et al. Agent-Oriented Integration of Distributed Mathematical Services , 1999, J. Univers. Comput. Sci..
[19] Uwe Waldmann. Cancellative Abelian monoids in refutational theorem proving , 1997 .
[20] Andrei Voronkov,et al. Partially Adaptive Code Trees , 2000, JELIA.
[21] Jörg Denzinger,et al. Cooperation of Heterogeneous Provers , 1999, IJCAI.
[22] Harald Ganzinger,et al. Theorem Proving in Cancellative Abelian Monoids (Extended Abstract) , 1996, CADE.
[23] C. Kirchner,et al. Deduction with symbolic constraints , 1990 .
[24] Andrei Voronkov,et al. Equality Reasoning in Sequent-Based Calculi , 2001, Handbook of Automated Reasoning.
[25] Alberto Martelli,et al. An Efficient Unification Algorithm , 1982, TOPL.
[26] Ewing L. Lusk,et al. Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years , 1992, LPAR.
[27] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[28] J. Urgen Stuber,et al. Superposition Theorem Proving for Abelian Groups Represented as Integer Modules , 1996 .
[29] James R. Slagle. Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets , 1972, JACM.
[30] Georg Gottlob,et al. On the efficiency of subsumption algorithms , 1985, JACM.
[31] Donald W. Loveland,et al. Mechanical Theorem-Proving by Model Elimination , 1968, JACM.
[32] William McCune,et al. Logic Machine Architecture: Inference Mechanisms , 1982, CADE.
[33] Harald Ganzinger,et al. Associative-Commutative Superposition , 1994, CTRS.
[34] I. V. Ramakrishnan,et al. Term Indexing , 2001, Handbook of Automated Reasoning.
[35] J. M. Rivero,et al. Data Structures and Algorithms for Automated Deduction with Equality , 2000 .
[36] Albert Rubio,et al. Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.
[37] Robert Nieuwenhuis. Rewrite-based deduction and symbolic constraints , 1999 .
[38] Stephan Schulz,et al. Learning search control knowledge for equational deduction , 2000, DISKI.
[39] Albert Rubio,et al. AC-Superposition with Constraints: No AC-Unifiers Needed , 1994, CADE.
[40] Mark E. Stickel. The Path-Indexing Method for Indexing Terms , 1989 .
[41] Paliath Narendran,et al. Double-exponential complexity of computing a complete set of AC-unifiers , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[42] Paul Walton Purdom,et al. Fast Many-to-One Matching Algorithms , 1985, RTA.