Sciweavers

122 search results - page 10 / 25
» Abductive Logic Programming by Nonground Rewrite Systems
Sort
View
ICLP
1997
Springer
15 years 1 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
AMAI
2004
Springer
15 years 2 months ago
Production Inference, Nonmonotonicity and Abduction
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic...
Alexander Bochman
63
Voted
ICALP
1990
Springer
15 years 1 months ago
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
Jan Willem Klop
JLP
1998
147views more  JLP 1998»
14 years 9 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
106
Voted
KRDB
1996
123views Database» more  KRDB 1996»
14 years 10 months ago
Flexible Query-Answering Systems Modelled in Metalogic Programming
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
Troels Andreasen, Henning Christiansen