| # |  | Publisher | Type | Year | | Title | |
|---|
| 1 |
 | Antoy, Sergio |
| |
| 1 |
|
| |
| | | Proceedings Article | 1994 | | A Needed Narrowing Strategy
In: Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94), 268-279 | |
| 12 |
| |
| 2 |
|
| IEEE |
| |
| | | Proceedings Article | 1994 | | Rewrite Techniques for Transitive Relations
In: Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 384-393 | |
| | | Proceedings Article | 1993 | | Set Constraints are the Monadic Class
In: Eighth Annual IEEE Symposium on Logic in Computer Science, 75-83 | |
| 1 |
|
| |
| | | Proceedings Article | 1991 | | Perfect model semantics for logic programs with equality
In: Proceedings International Conference on Logic Programming '91, 645-659 | |
| 1 |
|
| |
| | | Journal Article | 1994 | | Rewrite-based equational theorem proving with selection and simplification
In: Journal of Logic and Computation [4], 217-247 | |
| 8 |
|
| |
| | | Journal Article | 1994 | | Refutational Theorem Proving for Hierarchic First-Order Theories
In: Applicable Algebra in Engineering, Communication and Computing (AAECC) [5], 193-212 | |
| | | Proceedings Article | 1994 | | Buchberger's algorithm: a constraint-based completion procedure
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 285-301 | |
| | | Proceedings Article | 1994 | | Ordered Chaining for Total Orderings
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 435-450 | |
| | | Proceedings Article | 1993 | | Superposition with simplification as a decision procedure for the monadic class with equality
In: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, 83-96 | |
| | | Proceedings Article | 1992 | | Basic Paramodulation and Superposition
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 462-476 | |
| | | Proceedings Article | 1992 | | Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
In: Logic Programming and Automated Reasoning, 273-284 | |
| | | Proceedings Article | 1992 | | Theorem proving for hierarchic first-order theories
In: Algebraic and Logic Programming, 420-434 | |
| | | Proceedings Article | 1991 | | Completion of first-order clauses with equality by strict superposition
In: Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting, 162-180 | |
| 1 |
| Barnett, Richard |
| |
| 1 |
|
| |
| | | Journal Article | 1993 | | A Recursion Planning Analysis of Inductive Completion
In: Annals of Mathematics and Artificial Intelligence [8], 363-381 | |
| 5 |
| |
| 1 |
|
| Faculty of Luminy |
| |
| | | Proceedings Article | 1993 | | A Complete Symbolic 0-1 Constraint Solver
In: 3rd Workshop on Constraint Logic Programming (WCLP '93), ? | |
| 1 |
|
| IEEE |
| |
| | | Proceedings Article | 1993 | | Solving 0-1 Problems in CLP($\cal PB$)
In: Proceedings 9th Conference on Artificial Intelligence for Applications (CAIA), 263-269 | |
| 2 |
|
| Springer |
| |
| | | Proceedings Article | 1994 | | Simplifying Clausal Satisfiability Problems
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 19-33 | |
