Sciweavers

1588 search results - page 231 / 318
» On the Logic of Constitutive Rules
Sort
View
CORR
2006
Springer
112views Education» more  CORR 2006»
15 years 1 months ago
Satisfying KBO Constraints
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...
Harald Zankl, Aart Middeldorp
IJFCS
2006
132views more  IJFCS 2006»
15 years 1 months ago
Generalized Lr Parsing Algorithm for Boolean Grammars
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...
Alexander Okhotin
SOCO
2002
Springer
15 years 1 months ago
Fuzzy relation equations (I): the general and specialized solving algorithms
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...
Li Chen, Paul P. Wang
ACL
2010
14 years 11 months ago
Complexity Assumptions in Ontology Verbalisation
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...
Richard Power
ACSC
2008
IEEE
15 years 8 months ago
On illegal composition of first-class agent interaction protocols
In this paper, we examine the composition of firstclass protocols for multi-agent systems. First-class protocols are protocols that exist as executable specifications that agent...
Tim Miller, Peter McBurney