Sciweavers

305 search results - page 58 / 61
» Decidability of Split Equivalence
Sort
View
STACS
2009
Springer
14 years 2 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
ESWS
2009
Springer
14 years 2 months ago
A Reasoning-Based Support Tool for Ontology Mapping Evaluation
In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
Christian Meilicke, Heiner Stuckenschmidt, Ondrej ...
FCT
2009
Springer
14 years 2 months ago
Alternating Weighted Automata
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
WAOA
2007
Springer
106views Algorithms» more  WAOA 2007»
14 years 1 months ago
Full and Local Information in Distributed Decision Making
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
Panagiota N. Panagopoulou, Paul G. Spirakis
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...