Sciweavers

4403 search results - page 130 / 881
» Galois Theory of Algorithms
Sort
View
ATAL
2007
Springer
16 years 15 days ago
Negotiation partners selection mechanism based on context-dependent similarity relations
This paper proposes a context-dependent case-based mechanism for selecting negotiation partners with the focus on the adaptation of similarity relations to a specific context. Th...
Jakub Brzostowski, Ryszard Kowalczyk
COSIT
1999
Springer
162views GIS» more  COSIT 1999»
15 years 10 months ago
Terminological Default Reasoning about Spatial Information: A First Step
We extend the theory about terminological default reasoning by using a logical base language that can represent spatioterminological phenomena. Based on this description logic lang...
Ralf Möller, Michael Wessel
HYBRID
1997
Springer
15 years 10 months ago
Hybrid Systems with Finite Bisimulations
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
Gerardo Lafferriere, George J. Pappas, Shankar Sas...
VLDB
1989
ACM
44views Database» more  VLDB 1989»
15 years 10 months ago
Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...
Weimin Du, Ahmed K. Elmagarmid
LANMR
2004
15 years 7 months ago
Computing Preferred Safe Beliefs
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
Luis A. Montiel, Juan A. Navarro