Proof-complexity results for nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
A model and a first analysis of distributed-search contraction-based strategies
Annals of Mathematics and Artificial Intelligence
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
General Algorithms for Permutations in Equational Inference
Journal of Automated Reasoning
Deduction Systems, Rolf Socher-Ambrosius and Patricia Johann
Journal of Logic, Language and Information
Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Algorithms on Atomic Representations of Herbrand Models
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Analysis of Distributed-Search Contraction-Based Strategies
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Hyper Tableau - The Next Generation
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Hypotheses Finding via Residue Hypotheses with the Resolution Principle
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
On a Generalisation of Herbrand's Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A Theory of Hypothesis Finding in Clausal Logic
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Extending Decidable Clause Classes via Constraints
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Implicational Completeness of Signed Resolution
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Completeness and Redundancy in Constrained Clause Logic
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Information and Computation
Deciding the guarded fragments by resolution
Journal of Symbolic Computation
Hypothesis finding based on upward refinement of residue hypotheses
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Automated deduction for many-valued logics
Handbook of automated reasoning
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A fixpoint semantics and an SLD-resolution calculus for modal logic programs
Fundamenta Informaticae
Model building with ordered resolution: extracting models from saturated clause sets
Journal of Symbolic Computation - Special issue: First order theorem proving
Representing and Building Models for Decidable Subclasses of Equational Clausal Logic
Journal of Automated Reasoning
Completeness of hyper-resolution via the semantics of disjunctive logic programs
Information Processing Letters
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Theoretical Computer Science
The axiomatic translation principle for modal logic
ACM Transactions on Computational Logic (TOCL)
Towards an algorithmic construction of cut-elimination procedures†
Mathematical Structures in Computer Science
A Resolution Calculus with Shared Literals
Fundamenta Informaticae
CERES: An analysis of Fürstenberg's proof of the infinity of primes
Theoretical Computer Science
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Distributed reasoning with ontologies and rules in order-sorted logic programming
Web Semantics: Science, Services and Agents on the World Wide Web
Validation of Proofs Using PhoX
Electronic Notes in Theoretical Computer Science (ENTCS)
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Completeness of hyper-resolution via the semantics of disjunctive logic programs
Information Processing Letters
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
Journal of Symbolic Computation
Towards a clausal analysis of cut-elimination
Journal of Symbolic Computation
A taxonomy of theorem-proving strategies
Artificial intelligence today
Combining instance generation and resolution
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
I-terms in ordered resolution and superposition calculi: retrieving lost completeness
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Rules and logic programming for the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Finding finite herbrand models
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A calculus for generating ground explanations
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A Resolution Calculus with Shared Literals
Fundamenta Informaticae
A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs
Fundamenta Informaticae
An approach to abductive reasoning in equational logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A Resolution Calculus for First-order Schemata
Fundamenta Informaticae
| Hi-index | 0.00 |