232 search results - page 10 / 47 » Completeness and Decidability in Sequence Logic |
AAAI
1990
13 years 8 months ago
1990
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
AIML
2008
13 years 8 months ago
2008
Arbitrary public announcement logic (APAL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (pos...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
LATIN
2004
Springer
14 years 23 days ago
2004
Springer
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...