20 search results - page 2 / 4 » Rewriting Rules into SROIQ Axioms |
WWW
2011
ACM
13 years 2 months ago
2011
ACM
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...
TYPES
1998
Springer
13 years 11 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
ENTCS
2006
13 years 7 months ago
2006
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
LFP
1990
13 years 8 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...