Sciweavers

1650 search results - page 177 / 330
» The HOM problem is decidable
Sort
View
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
15 years 5 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
CADE
2010
Springer
15 years 5 months ago
An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
Yevgeny Kazakov
GIR
2008
ACM
15 years 5 months ago
Mining the web to detect place names
With the aim to improve the quality of gazetteers for geographic information retrieval systems, we present a method to detect place names employed by people submitting information...
Florian A. Twaroch, Philip D. Smart, Christopher B...
AI
2007
Springer
15 years 4 months ago
Subjective logic and arguing with evidence
This paper introduces a Subjective Logic based argumentation framework primarily targeted at evidential reasoning. The framework explicitly caters for argument schemes, accrual of...
Nir Oren, Timothy J. Norman, Alun D. Preece
ALIFE
2008
15 years 4 months ago
Criteria for Conceptual and Operational Notions of Complexity
While complex systems have been studied now for more than two decades, there still is no agreement on what complexity actually is. This lack of a definition might be a problem when...
Dominique Chu