Sciweavers

2920 search results - page 124 / 584
» Finite information logic
Sort
View
DALT
2004
Springer
15 years 6 months ago
The Logic of Communication Graphs
In 1992, Moss and Parikh studied a bimodal logic of knowledge and effort called Topologic. In this current paper, Topologic is extended to the case of many agents who are assumed...
Eric Pacuit, Rohit Parikh
99
Voted
ISCIS
2009
Springer
15 years 7 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
105
Voted
ICDT
2007
ACM
74views Database» more  ICDT 2007»
15 years 4 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
115
Voted
FOIKS
2008
Springer
15 years 2 months ago
Lossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Henning Köhler, Sebastian Link
82
Voted
EACL
2003
ACL Anthology
15 years 2 months ago
A Dynamic Logic Formalisation of the Dialogue Gameboard
This paper explores the possibility of using the paradigm of Dynamic Logic (DL) to formalise information states and update processes on information states. In particular, we prese...
Raquel Fernández