Search results for "CADE"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Ronald V. Book	The Power of the Church-Rosser Property for String Rewriting Systems.	CADE	1982	DBLP DOI BibTeX RDF
1	Donald W. Loveland (eds.)	6th Conference on Automated Deduction, New York, USA, June 7-9, 1982, Proceedings	CADE	1982	DBLP DOI BibTeX RDF
1	K. M. Hörnig, Wolfgang Bibel	Improvements of a Tautology-Testing Algorithm.	CADE	1982	DBLP DOI BibTeX RDF
1	Steven K. Winker, Larry Wos	Procedure Implementation Through Demodulation and Related Tricks.	CADE	1982	DBLP DOI BibTeX RDF
1	Dov M. Gabbay	Intuitonistic Basis for Non-Monotonic Logic.	CADE	1982	DBLP DOI BibTeX RDF
1	Larry Wos	Solving Open Questions with an Automated Theorem-Proving Program.	CADE	1982	DBLP DOI BibTeX RDF
1	Bernard Silver	The Application of Homogenization to Simultaneous Equations.	CADE	1982	DBLP DOI BibTeX RDF	simultaneous equations, meta level inference, algebraic manipulation, mathematical reasoning, equation solving-rewrite rules, Homogenization
1	Dale A. Miller, Eve Longini Cohen, Peter B. Andrews	A Look at TPS.	CADE	1982	DBLP DOI BibTeX RDF
1	Chris Goad	Automatic Construction of Special Purpose Programs.	CADE	1982	DBLP DOI BibTeX RDF
1	Leon Sterling, Alan Bundy	Meta-Level Inference and Program Verification.	CADE	1982	DBLP DOI BibTeX RDF	meta-level inference, logic programming, program verification
1	Robert E. Shostak	Deciding Combinations of Theories.	CADE	1982	DBLP DOI BibTeX RDF
1	Robert E. Shostak, Richard L. Schwartz, P. M. Melliar-Smith	STP: A Mechanized Logic for Specification and Verification.	CADE	1982	DBLP DOI BibTeX RDF
1	Alan M. Frisch, James F. Allen	Knowledge Retrieval as Limited Inference.	CADE	1982	DBLP DOI BibTeX RDF
1	Douglas R. Smith	Derived Preconditions and Their Use in Program Synthesis.	CADE	1982	DBLP DOI BibTeX RDF
1	Paul Y. Gloess, Jean-Pierre H. Laurent	Adding Dynamic Paramodulation to Rewrite Algorithms.	CADE	1980	DBLP DOI BibTeX RDF	critical pairs, Knuth-Bendix algorithm, paramodulation, rewrite algorithms, theorem-proving, rewrite rules
1	Chris Goad	Proofs as Description of Computation.	CADE	1980	DBLP DOI BibTeX RDF
1	Luigia Carlucci Aiello, Richard W. Weyhrauch	Using Meta-Theoretic Reasoning to do Algebra.	CADE	1980	DBLP DOI BibTeX RDF
1	Peter B. Andrews	Transforming Matings into Natural Deduction Proofs.	CADE	1980	DBLP DOI BibTeX RDF
1	Luís Moniz Pereira, António Porto	Selective Backtracking for Logic Programs.	CADE	1980	DBLP DOI BibTeX RDF
1	Alan M. Thompson	Logical Support in a Time-Varying Model.	CADE	1980	DBLP DOI BibTeX RDF
1	Donald W. Loveland, Robert E. Shostak	Simplifying Interpreted Formulas.	CADE	1980	DBLP DOI BibTeX RDF
1	David A. Plaisted	Abstraction Mappings in Mechanical Theorem Proving.	CADE	1980	DBLP DOI BibTeX RDF
1	Gérard D. Guiho, Christian Gresse	Program Synthesis from Incomplete Specifiactions.	CADE	1980	DBLP DOI BibTeX RDF
1	Jacek Leszczylowski	An Experiment with "Edinburgh LCF".	CADE	1980	DBLP DOI BibTeX RDF
1	W. W. Bledsoe, Larry M. Hines	Variable Elimination and Chaining in a Resolution-based Prover for Inequalities.	CADE	1980	DBLP DOI BibTeX RDF
1	Laurent Kott	A System for Proving Equivalences of Recursive Programs.	CADE	1980	DBLP DOI BibTeX RDF
1	Alfredo Ferro, Eugenio G. Omodeo, Jacob T. Schwartz	Decision Procedures for Some Fragments of Set Theory.	CADE	1980	DBLP DOI BibTeX RDF
1	Alan Bundy, Bob Welham	Using Meta-Level Inference for Selective Application of Multiple Rewrite Rules in Algebraic Manipulation.	CADE	1980	DBLP DOI BibTeX RDF	mathematical reasoning, algebraic manipulation and meta-level reasoning, theorem proving, rewrite rules
1	Roddy W. Erickson, David R. Musser	The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs.	CADE	1980	DBLP DOI BibTeX RDF
1	Gábor Belovári, John A. Campbell	Generating Contours of Integration: An Application of Prolog in Symbolic Computing.	CADE	1980	DBLP DOI BibTeX RDF
1	Helga Noll	A Note on Resolution: How to Get Rid of Factoring without Loosing Completeness.	CADE	1980	DBLP DOI BibTeX RDF	theorem proving, factoring, first order logic, resolution
1	Leonard Friedman	Reasoning by Plausible Inference.	CADE	1980	DBLP DOI BibTeX RDF
1	Jean-Marie Hullot	Canonical Forms and Unification.	CADE	1980	DBLP DOI BibTeX RDF
1	Wolfgang Bibel, Robert A. Kowalski (eds.)	5th Conference on Automated Deduction, Les Arcs, France, July 8-11, 1980, Proceedings	CADE	1980	DBLP DOI BibTeX RDF
1	Larry Wos, Ross A. Overbeek, Lawrence J. Henschen	Hyperparamodulation: A Refinement of Paramodulation.	CADE	1980	DBLP DOI BibTeX RDF
1	Ross A. Overbeek, Ewing L. Lusk	Data Structures and Control Architectures for Implementation of Theorem-Proving Programs.	CADE	1980	DBLP DOI BibTeX RDF
1	Paul Y. Gloess	An Experiment with the Boyer-Moore Theorem Prover: A Proof of the Correctness of a Simple Parser of Expressions.	CADE	1980	DBLP DOI BibTeX RDF
1	Hans-Josef Jeanrond	Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully.	CADE	1980	DBLP DOI BibTeX RDF
1	Joseph A. Goguen	How to Prove Algebraic Inductive Hypotheses Without Induction.	CADE	1980	DBLP DOI BibTeX RDF
1	Philip T. Cox, Tomasz Pietrzykowski	A Complete, Nonredundant Algorithm for Reversed Skolemization.	CADE	1980	DBLP DOI BibTeX RDF
1	Maurice Bruynooghe	Analysis of Dependencies to Improve the Behaviour of Logic Programs.	CADE	1980	DBLP DOI BibTeX RDF
1	Rob Nederpelt	An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus.	CADE	1980	DBLP DOI BibTeX RDF
1	Frederick C. Furtek	Specification and Verification of Real-Time, Distributed Systems Using the Theory of Constraints.	CADE	1980	DBLP DOI BibTeX RDF

Publications at "CADE"( http://dblp.L3S.de/Venues/CADE )