20 search results - page 3 / 4 » Rewriting Rules into SROIQ Axioms |
COLING
1992
14 years 10 months ago
1992
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
TLCA
2007
Springer
15 years 3 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
GPEM
2007
14 years 9 months ago
2007
We present a novel means of algorithmically describing a growth process that is an extension of Lindenmayer’s Map L-systems. This growth process relies upon a set of rewrite rule...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...