Sciweavers

1458 search results - page 63 / 292
» Extended Term Rewriting Systems
Sort
View
LFCS
2007
Springer
15 years 4 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
CIKM
2004
Springer
15 years 3 months ago
Extending and inferring functional dependencies in schema transformation
We study the representation, derivation and utilization of a special kind of constraints in multidatabase systems. A major challenge is when component database schemas are schemat...
Qi He, Tok Wang Ling
CADE
2006
Springer
15 years 10 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
AAAI
2011
13 years 9 months ago
Recognizing Plans with Loops Represented in a Lexicalized Grammar
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
Christopher W. Geib, Robert P. Goldman
KI
2008
Springer
14 years 9 months ago
Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
Martin Hofmann 0008, Emanuel Kitzelmann, Ute Schmi...