Expressive power of knowledge representation systems
International Journal of Man-Machine Studies
Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Completion for rewriting modulo a congruence
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
On restrictions of ordered paramodulation with simplification
CADE-10 Proceedings of the tenth international conference on Automated deduction
Any ground associative-commutative theory has a finite canonical system
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
Journal of the ACM (JACM)
Rough sets: a new approach to vagueness
Fuzzy logic for the management of uncertainty
Journal of Symbolic Computation
Tcl and the Tk toolkit
From rough set theory to evidence theory
Advances in the Dempster-Shafer theory of evidence
Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
Information and Computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Rough Sets, Fuzzy Sets and Knowledge Discovery
Rough Sets, Fuzzy Sets and Knowledge Discovery
Automated deduction with associative commutative operators
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
A Precedence-Based Total AC-Compatible Ordering
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Positive Deduction modulo Regular Theories
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
AC-Superposition with Constraints: No AC-Unifiers Needed
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Associative-Commutative Deduction with Constraints
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Combination of Compatible Reduction Orderings that are Total on Ground Terms
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Automated Discovery of Properties of Rough Sets
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
We present a non-exhaustive state of the art in the domain of deduction in first-order logic with equality, describing different strategies introduced over the years: strategies for selecting deduction steps, for eliminating redundant information, for delaying the resolution of unsolved or too difficult problems, for applying deductions with built-in properties. We also present the system da&Tgr;ac that implements our deduction techniques modulo associative-commutative properties. Finally we detail an application of those techniques to the study of non-classical logics, work realised in collaboration with Prof. Wasilewska (Stony Brook University, New York).