3032 search results - page 411 / 607 » Description Logic Rules |
103
click to vote
CORR
2006
Springer
15 years 25 days ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
130
click to vote
IJFCS
2006
15 years 24 days ago
2006
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
91
Voted
SOCO
2002
Springer
15 years 13 days ago
2002
Springer
In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathema...
107
Voted
ACL
2010
14 years 11 months ago
2010
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
84
Voted
CADE
2005
Springer
16 years 1 months ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...