default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automated Reasoning (JAR), Volume 6
Volume 6, Number 1, March 1990
- Yves Auffray, Patrice Enjalbert, Jean-Jacques Hébrard:
Strategies for Modal Resolution: Results and Problems. 1-38 - Pierre Lescanne:
On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings. 39-49 - John W. Roach, R. Sundararajan, Layne T. Watson:
Replacing Unification by Constraint Satisfaction to Improve Logic Program Expressiveness. 51-75
- Larry Wos:
The Problem of Choosing between Logic Programming and General-Purpose Automated Reasoning. 77-78
- Siva Anantharaman, Jieh Hsiang
:
Automated Proofs of the Moufang Identities in Alternative Rings. 79-109
Volume 6, Number 2, June 1990
- John Staples, Peter J. Robinson:
Structure Sharing for Quantified Terms: Fundamentals. 115-145 - James J. Lu, V. S. Subrahmanian:
Protected Completions of First-Order General Logic Programs. 147-172 - Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
The Automation of Syllogistic. 173-187 - Domenico Cantone, Vincenzo Cutello:
Decision Procedures for Elementary Sublanguages of Set Theory. 189-201 - Giuseppa Carrà Ferro, Giovanni Gallo:
A Procedure to Prove Statements in Differential Geometry. 203-209
- Larry Wos:
The Problem of Finding a Mapping between Clause Representation and Natural-Deduction Representation. 211-212
- Larry Wos:
Meeting the Challenge of Fifty Years of Logic. 213-232
Volume 6, Number 3, September 1990
- Timothy Stokes:
Gröbner Bases in Exterior Algebra. 233-250 - Yuan Yu:
Computer Proofs in Group Theory. 251-286 - Wolfgang Bibel:
Short Proofs of the Pigeonhole Formulas Based on the Connection Method. 287-297 - Joseph S. di Piazza:
Interweaving Knowledge Extracting, Organizing and Evaluating: A Concrete Design for Preventing Logic and Structure Bugs while Interviewing Experts. 299-317 - Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen:
Equivalence of Propositional Prolog Programs. 319-335
- Larry Wos:
The Problem of Finding a Semantic Strategy for Focusing Inference Rules. 337-339
- W. W. Bledsoe:
Challenge Problems in Elementary Calculus. 341-359
Volume 6, Number 4, December 1990
- Peter F. Patel-Schneider:
A Decidable First-Order Logic for Knowldge Representation. 361-388 - David A. Plaisted:
A Sequent-Style Model Elimination Strategy and a Positive Refinement. 389-402 - Xiao-Shan Gao:
Transcendental Functions and Mechanical Theorem Proving in Elemantary Geometries. 403-417 - John L. Pollock:
Interest Driven Suppositional Reasoning. 419-461
- Larry Wos:
The Problem of Choosing between Predicate and Function Notation for Problem Representation. 463-464
- Steve Winker:
Robbins Algebra: Conditions That Make a Near-Boolean Algebra Boolean. 465-489
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-02-27 22:35 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:
