|
Conferences in DBLP
- Hantao Zhang, Deepak Kapur
First-Order Theorem Proving Using Conditional Rewrite Rules. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:1-20 [Conf]
- Tie-Cheng Wang
Elements of Z-Module Reasoning. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:21-40 [Conf]
- Michael R. Donat, Lincoln A. Wallen
Learning and Applying Generalised Solutions using Higher Order Resolution. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:41-60 [Conf]
- Amy P. Felty, Dale Miller
Specifying Theorem Provers in a Higher-Order Logic Programming Language. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:61-80 [Conf]
- V. S. Subrahmanian
Query Processing in Quantitative Logic Programming. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:81-100 [Conf]
- David A. Basin
An Environment For Automated Reasoning About Partial Functions. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:101-110 [Conf]
- Alan Bundy
The Use of Explicit Plans to Guide Inductive Proofs. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:111-120 [Conf]
- D. Duchier, Drew V. McDermott
LOGICALC: An Environment for Interactive Proof Development. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:121-130 [Conf]
- Maritta Heisel, Wolfgang Reif, Werner Stephan
Implementing Verification Strategies in the KIV-System. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:131-140 [Conf]
- Donald Simon
Checking Natural Language Proofs. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:141-150 [Conf]
- Marc Bezem
Consistency of Rule-based Expert System. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:151-161 [Conf]
- Hantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy
A Mechanizable Induction Principle for Equational Specifications. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:162-181 [Conf]
- Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:182-196 [Conf]
- Michael A. McRobbie, Robert K. Meyer, Paul B. Thistlewaite
Towards Efficient "Knowledge-Based" Automated Theorem Proving for Non-Standard Logics. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:197-217 [Conf]
- A. A. Aaby, K. T. Narayana
Propositional Temporal Interval Logic is PSPACE Complete. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:218-237 [Conf]
- Douglas J. Howe
Computational Metatheory in Nuprl. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:238-257 [Conf]
- H. Azzoune
Type Inference in Prolog. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:258-277 [Conf]
- Jack Minker, Arcot Rajasekar
Procedural Interpretation of Non-Horn Logic Programs. [Citation Graph (2, 0)][DBLP] CADE, 1988, pp:278-293 [Conf]
- Shan Chi, Lawrence J. Henschen
Recursive Query Answering with Non-Horn Clauses. [Citation Graph (2, 0)][DBLP] CADE, 1988, pp:294-312 [Conf]
- Toshiro Wakayama, T. H. Payne
Case Inference in Resolution-Based Languages. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:313-322 [Conf]
- Ralph Butler, Rasiah Loganantharaj, Robert Olsen
Notes on Prolog Program Transformations, Prolog Style, and Efficient Compilation to The Warren Abstract Machine. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:323-332 [Conf]
- Ralph Butler, Nicholas T. Karonis
Exploitation of Parallelism in Prototypical Deduction Problems. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:333-343 [Conf]
- Louise E. Moser
A Decision Procedure for Unquantified Formulas of Graph Theory. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:344-357 [Conf]
- Patrick Lincoln, Jim Christian
Adventures in Associative-Commutative Unification (A Summary). [Citation Graph (1, 0)][DBLP] CADE, 1988, pp:358-367 [Conf]
- Wolfram Büttner
Unification in Finite Algebras is Unitary (?). [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:368-377 [Conf]
- Manfred Schmidt-Schauß
Unification in a Combination of Arbitrary Disjoint Equational Theories. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:378-396 [Conf]
- Karl-Hans Bläsius, Jörg H. Siekmann
Partial Unification for Graph Based Equational Reasoning. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:397-414 [Conf]
- Rainer Manthey, François Bry
SATCHMO: A Theorem Prover Implemented in Prolog. [Citation Graph (8, 0)][DBLP] CADE, 1988, pp:415-434 [Conf]
- Richard C. Potter, David A. Plaisted
Term Rewriting: Some Experimental Results. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:435-453 [Conf]
- Bishop Brock, Shaun Cooper, William Pierce
Analogical Reasoning and Proof Discovery. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:454-468 [Conf]
- Larry M. Hines
Hyper-Chaining and Knowledge-Based Theorem Proving. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:469-486 [Conf]
- Luis Fariñas del Cerro, Andreas Herzig
Linear Modal Deductions. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:487-499 [Conf]
- Hans Jürgen Ohlbach
A Resolution Calculus for Modal Logics. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:500-516 [Conf]
- Hans-Jürgen Bürckert
Solving Disequations in Equational Theories. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:517-526 [Conf]
- Emmanuel Kounalis, Michaël Rusinowitch
On Word Problems in Horn Theories. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:527-537 [Conf]
- Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
Canonical Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:538-549 [Conf]
- Paul Jacquet
Program Synthesis by Completion with Dependent Subtypes. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:550-562 [Conf]
- Thomas Käufl
Reasoning about Systems of Linear Inequalities. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:563-572 [Conf]
- Rolf Socher
A Subsumption Algorithm Based on Characteristic Matrices. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:573-581 [Conf]
- Arkady Rabinov
A Restriction of Factoring in Binary Resolution. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:582-591 [Conf]
- Philippe Besnard, Pierre Siegel
Supposition-Based Logic for Automated Nonmontonic Reasoning. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:592-601 [Conf]
- Christoph Walther
Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:602-621 [Conf]
- Leo Marcus, Timothy Redmond
Two Automated Methods in Implementation Proofs. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:622-642 [Conf]
- Mark Franzen, Lawrence J. Henschen
A New Approach to Universal Unification and Its Application to AC-Unification. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:643-657 [Conf]
- Neil V. Murray, Erik Rosenthal
An Implementation of a Dissolution-Based System Employing Theory Links. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:658-674 [Conf]
- Ilkka Niemelä
Decision Procedure for Autoepistemic Logic. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:675-684 [Conf]
- Peter K. Malkin, Errol P. Martin
Logical Matrix Generation and Testing. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:685-693 [Conf]
- Rakesh M. Verma, I. V. Ramakrishnan
Optimal Time Bounds for Parallel Term Matching. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:694-703 [Conf]
- William McCune
Challenge Equality Problems in Lattice Theory. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:704-709 [Conf]
- Frank Pfenning
Single Axioms in the Implicational Propositional Calculus. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:710-713 [Conf]
- Larry Wos, William McCune
Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:714-729 [Conf]
- Rick L. Stevens
Challenge Problems from Nonassociative Rings for Theorem Provers. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:730-734 [Conf]
- Matt Kaufmann
An Interactive Enhancement to the Boyer-Moore Theorem Prover. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:735-736 [Conf]
- David A. Plaisted
A Goal Directed Theorem Prover. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:737- [Conf]
- Bill Pase, Sentot Kromodimoeljo
m-NEVER System Summary. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:738-739 [Conf]
- Timothy Griffin
EFS - An Interactive Environment for Formal Systems. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:740-741 [Conf]
- David A. McAllester
Ontic: A Knowledge Representation System for Mathematics. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:742-743 [Conf]
- Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade
Some Tools for an Inference Laboratory (ATINF). [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:744-745 [Conf]
- V. S. Subrahmanian, Zerksis D. Umrigar
QUANTLOG: A System for Approximate Reasoning in Inconsistent Formal Systems. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:746-747 [Conf]
- Stephen J. Garland, John V. Guttag
LP: The Larch Prover. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:748-749 [Conf]
- Mark E. Stickel
The KLAUS Automated Deduction System. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:750-751 [Conf]
- Mark E. Stickel
A Prolog Technology Theorem Prover. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:752-753 [Conf]
- Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov
Lambda-Prolog: An Extended Logic Programming Language. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:754-755 [Conf]
- Frank M. Brown, Seung S. Park
SYMEVAL: A Theorem Prover Based on the Experimental Logic. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:756-757 [Conf]
- Frank M. Brown, Seung S. Park, Jim Phelps
ZPLAN: An Automatic Reasoning System for Situations. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:758-759 [Conf]
- Peter B. Andrews, Sunil Issar, Daniel Nesmith, Frank Pfenning
The TPS Theorem Proving System. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:760-761 [Conf]
- Pierre Bieber, Luis Fariñas del Cerro, Andreas Herzig
MOLOG: a Modal PROLOG. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:762-763 [Conf]
- P. E. Allen, Soumitra Bose, Edmund M. Clarke, Spiro Michaylov
PARTHENON: A Parallel Theorem Prover for Non-Horn Clauses. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:764-765 [Conf]
- Bruce T. Smith, Donald W. Loveland
An nH-Prolog Implementation. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:766-767 [Conf]
- Deepak Kapur, Hantao Zhang
RRL: A Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:768-769 [Conf]
- David Cyrluk, Richard M. Harris, Deepak Kapur
GEOMETER: A Theorem Prover for Algebraic Geometry. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:770-771 [Conf]
- Lawrence C. Paulson
Isabelle: The Next Seven Hundred Theorem Provers. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:772-773 [Conf]
- Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Alexander Herold
The CHIP System: Constraint Handling In Prolog. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:774-775 [Conf]
|