default search action
Journal of Automated Reasoning (JAR), Volume 12
Volume 12, Number 1, 1994
- Eliezer L. Lozinskii:
Resolving Contradictions: A Plausible Semantics for Inconsistent Systems. 1-32 - J Strother Moore:
Introduction to the OBDD Algorithm for the ATP Community. 33-46 - Taïeb Mellouli:
TMPR: A Tree-Structured Modified Problem Reduction Proof Procedure and Its Extension to Three - Valued Logic. 47-88 - Belaid Benhamou, Lakhdar Sais:
Tractability Through Symmetries in Propositional Calculus. 89-102 - J. Stuart Aitken, Han Reichgelt, Nigel Shadbolt:
Resolution Theorem Proving in Reified Modal Logics. 103-130
Volume 12, Number 2, 1994
- Ralph Butler, Ross A. Overbeek:
Formula Databases for High-Performance Resolution/Paramodulation Systems. 139-156 - Seng-cho Timothy Chou, Marianne Winslett:
A Model-Based Belief Revision System. 157-208 - Edmund K. Burke:
Unification in partially commutative semigroups. 209-223 - Maria Paola Bonacina, Jieh Hsiang:
On subsumption in distributed derivations. 225-240 - Vincent J. Digricoli:
The Rue Theorem-Proving System: The Complete Set if LIM+ Challenge Problems. 241-264 - Larry Wos:
The problem of hyperparamodulation. 265-271
Volume 12, Number 3, 1994
- Tanel Tammet:
Proof Sytrategies in Linear Logic. 273-304 - Louiqa Raschid, Jorge Lobo:
A Semantics for a Class of Non-Deterministic and Causal Production System Programs. 305-349 - Giuseppa Carrà Ferro:
An Extension of a Procedure to Prove Statements in Differential Geometry. 351-358 - Shie-Jue Lee, Chih-Hung Wu:
Improving the Efficiency of a Hyperlinking-Based Theorem Prover by Incremental Evaluation with Network Structures. 359-388 - Zhenyu Qian, Tobias Nipkow:
Reduction and Unification in Lambda Calculi with a General Notion of Subtype. 389-406
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.