35 search results - page 5 / 7 » Introducing Abduction into (Extensional) Inductive Logic Pro... |
128
Voted
CADE
2001
Springer
16 years 4 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
245
Voted
PADL
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
147
Voted
PPDP
2007
Springer
15 years 10 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
130
Voted
CAEPIA
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to b...
134
Voted
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...