Sciweavers

2920 search results - page 44 / 584
» Finite information logic
Sort
View
TIME
2005
IEEE
14 years 3 months ago
Exploiting the Relationship between IA Networks and Finite Domain CSPs
We exploit the fact that qualitative Interval Algebra (IA) network problems are finite domain CSPs. In the first part of the paper, we show how to convert a qualitative IA network ...
André Trudel, Haiyi Zhang
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 9 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
CADE
2004
Springer
14 years 10 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
IEEESCC
2005
IEEE
14 years 3 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull
IFIP
2009
Springer
13 years 7 months ago
Finite Models in FOL-Based Crypto-Protocol Verification
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
Jan Jürjens, Tjark Weber