default search action
Journal of Automated Reasoning (JAR), Volume 20
Volume 20, Number 1/2, April 1998
- José Júlio Alferes, Luís Moniz Pereira:
Preface: Logics for Artificial Intelligence. J. Autom. Reason. 20(1): 1-3 (1998) - Hans de Nivelle:
An Algorithm for the Retrieval of Unifiers from Discrimination Trees. 5-25 - Gilles Défourneaux, Christophe Bourely, Nicolas Peltier:
Semantic Generalizations for Proving and Disproving Conjectures by Analogy. 27-45 - Anatoli Degtyarev, Andrei Voronkov:
What You Always Wanted to Know about Rigid E-Unification. 47-80 - Peter Fröhlich, Wolfgang Nejdl, Michael Schroeder:
Strategies in Model-Based Diagnosis. 81-105 - José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski:
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming. 107-142 - Stefan Brass, Jürgen Dix:
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA. 143-165 - Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino:
Informational Logic as a Tool for Automated Reasoning. 167-190 - Philippe Besnard, Torsten Schaub:
Signed Systems for Paraconsistent Reasoning. 191-213
Volume 20, Number 3, June 1998
- Guoxiang Huang, Dale Myers:
Subgoal Strategies for Solving Board Puzzles. 215-253
- Erica Melis:
The Heine-Borel Challenge Problem. In Honor of Woody Bledsoe. 255-282 - Kahlil Hodgson:
Shortest Single Axioms for the Equivalential Calculus with CD and RCD. 283-316 - Hans Jürgen Ohlbach:
Elimination of Self-Resolving Clauses. 317-336 - M. Paramasivam, David A. Plaisted:
Automated Deduction Techniques for Classification in Description Logic Systems. 337-364 - Abdelilah Kandri-Rody, Hamid Maarouf, Mohamed Ssafini:
Triviality and Dimension of a System of Algebraic Differential Equations. 365-385
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.