Sciweavers

52 search results - page 6 / 11
» Algorithmic correspondence and completeness in modal logic
Sort
View
TARK
2007
Springer
14 years 2 months ago
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of age...
Philippe Balbiani, Alexandru Baltag, Hans P. van D...
ENTCS
2006
181views more  ENTCS 2006»
13 years 8 months ago
Conditional Doxastic Models: A Qualitative Approach to Dynamic Belief Revision
In this paper, we present a semantical approach to multi-agent belief revision and belief update. For this, we introduce relational structures called conditional doxastic models (...
Alexandru Baltag, Sonja Smets
NIPS
2003
13 years 9 months ago
Reasoning about Time and Knowledge in Neural Symbolic Learning Systems
We show that temporal logic and combinations of temporal logics and modal logics of knowledge can be effectively represented in artificial neural networks. We present a Translat...
Artur S. d'Avila Garcez, Luís C. Lamb
ICALP
2010
Springer
14 years 22 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
FUIN
2007
134views more  FUIN 2007»
13 years 8 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...