Sciweavers

164 search results - page 7 / 33
» Formalization and abstract implementation of rewriting with ...
Sort
View
ECAI
2000
Springer
13 years 11 months ago
A Family of Defeasible Reasoning Logics and its Implementation
Abstract. Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more effic...
Grigoris Antoniou, David Billington, Guido Governa...
JLP
2010
96views more  JLP 2010»
13 years 2 months ago
An overview of the K semantic framework
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
Grigore Rosu, Traian-Florin Serbanuta
PPSN
1994
Springer
13 years 11 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
IDEAS
2005
IEEE
101views Database» more  IDEAS 2005»
14 years 1 months ago
Rewriting-Based Optimization for XQuery Transformational Queries
The modern XML query language called XQuery includes advanced facilities both to query and to transform XML data. An XQuery query optimizer should be able to optimize any query. F...
Maxim Grinev, Peter Pleshachkov
CSL
2010
Springer
13 years 7 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann