Sciweavers

STACS
1993
Springer
14 years 3 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
STACS
1993
Springer
14 years 3 months ago
Language Learning With Some Negative Information
Ganesh Baliga, John Case, Sanjay Jain
STACS
1993
Springer
14 years 3 months ago
A First-Order Isomorphism Theorem
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
Eric Allender, José L. Balcázar, Nei...
RTA
1993
Springer
14 years 3 months ago
Redundancy Criteria for Constrained Completion
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
Christopher Lynch, Wayne Snyder
RTA
1993
Springer
14 years 3 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
Jordi Levy, Jaume Agustí-Cullell
RTA
1993
Springer
14 years 3 months ago
Total Termination of Term Rewriting
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
Maria C. F. Ferreira, Hans Zantema
RTA
1993
Springer
14 years 3 months ago
More Problems in Rewriting
Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Will...
RTA
1993
Springer
14 years 3 months ago
Topics in Termination
Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving...
Nachum Dershowitz, Charles Hoot