Sciweavers

4126 search results - page 652 / 826
» Set based logic programming
Sort
View
KCAP
2009
ACM
15 years 4 months ago
Formally measuring agreement and disagreement in ontologies
Ontologies are conceptual models of particular domains, and domains can be modeled differently, representing different opinions, beliefs or perspectives. In other terms, ontolog...
Mathieu d'Aquin
71
Voted
CONCUR
2005
Springer
15 years 3 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...
FSKD
2005
Springer
101views Fuzzy Logic» more  FSKD 2005»
15 years 3 months ago
Geometrical Probability Covering Algorithm
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
Junping Zhang, Stan Z. Li, Jue Wang
84
Voted
ER
2004
Springer
90views Database» more  ER 2004»
15 years 3 months ago
Semantic Interpretation and Matching of Web Services
A major issue in the study of semantic Web services concerns the matching problem of Web services. Various techniques for this problem have been proposed. Typical ones include FSM ...
Chang Xu, Shing-Chi Cheung, Xiangye Xiao
TPHOL
1999
IEEE
15 years 2 months ago
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
Markus Wenzel